AI Slop Code Risk Monitor

EndlessCheng/codeforces-go

Name: EndlessCheng/codeforces-go — Go Code Quality & Security Review | AI Slop Code Risk Monitor
Creator: AI Slop Code Risk Monitor

Adjusted legacy signal; badge bands: 25 / 50 / 75 (different from dashboard bands).

算法竞赛模板库 by 灵茶山艾府 💭💡🎈

0.3 Low pattern signal View on GitHub

Open-Source Code Quality, Security and Technical Debt Review

This report summarizes scanner evidence for EndlessCheng/codeforces-go, a Go project with 8,797 GitHub stars. SynthScan examined 1,136,377 lines of code across 17195 source files, recording 390 pattern matches distributed across 2 syntactic categories. The legacy adjusted pattern signal is 0.3 (Low pattern signal); it is not an authorship estimate.

Use the findings to ask whether maintainers can explain intent, verify dependencies, simplify unnecessary scaffolding, and focus review effort. Risk Payload v1 adds ownership, supply-chain, over-engineering, and review-effort vectors when available. These are prompts for human verification, not probabilities, security findings, or measured maintenance costs.

0.3

Adjusted Signal

0.3

Raw Pattern Score

100%

Time Factor

2026-10-27

Last Push

8.8K

Stars

Language

1.1M

Lines of Code

17.2K

Files

390

Pattern Hits

2026-10-31

Scan Date

0.00

HC Hit Rate

Risk Review · Payload v1

Use each vector to guide manual verification of the underlying findings.

Payload schema: 1.0.0 · Engine: 2.0.0 · Scoring: heuristic-density-v1 · Scan date: 2026-10-31.

Cognitive Ownership Risk 1.6/100 · LOW

Can maintainers explain intent, assumptions, and trade-offs? 390 finding(s).

Hallucinated Dependency & Supply Chain Risk 0.0/100 · LOW

Are imports declared and package/API names verified? 0 finding(s).

Agent Over-Engineering Ratio 0.0/100 · LOW

Are wrappers, guards, and repeated structures necessary? 2 finding(s).

PR Review Velocity Impact 1.7/100 · LOW

Which changes need focused human review? 390 finding(s).

What These Metrics Mean

Adjusted Signal: Legacy pattern score normalized per 1,000 scanned lines and multiplied by the repository-level time factor. It is not an estimate of AI authorship.
Raw Pattern Score: Sum of severity- and context-weighted pattern findings before applying the time factor.
Time Factor: A coarse multiplier based on repository last-push metadata. It does not identify when individual code was written.
Pattern Hits: Count of configured pattern findings. Review each location and surrounding code before acting.
HC Hit Rate: High- and critical-severity findings per scanned file. Severity is a configured detector weight, not proof of a vulnerability or authorship.
Lines / Files: Scan coverage denominators used by the legacy normalized score.

Pattern-Signal History

This chart tracks the legacy adjusted pattern score across scan runs. Changes can reflect source changes, scan coverage, or detector/scoring versions; they do not measure AI adoption or prove that a team refactored code. Compare runs only when their scoring versions are compatible. The dashed line tracks the raw pattern-hit count.

Severity Breakdown

Groups findings by configured severity weight. Severity is not a confidence estimate, security rating, or proof that a package is missing. Verify imports against the project's manifests and inspect each finding in its local design context.

CRITICAL 0HIGH 0MEDIUM 0LOW 390

Directory Score Breakdown

This horizontal bar chart shows where configured pattern scores accumulate across directories. Treat the bars as locations to inspect, not as evidence of authorship or code quality. Use the file-level findings to decide whether a directory needs a focused ownership, dependency, complexity, or review check.

Pattern Findings

The scanner identified 390 distinct pattern matches across 2 syntactic categories. Each entry below represents a discrete location in the source code where the engine recorded a detector match to inspect in context. Expand any category row to inspect the individual file paths, line numbers, code snippets, and the lexical context (CODE, COMMENT, or STRING) in which each match was detected.

Reading the findings table: The Severity column indicates the configured finding weight (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — legacy comment-context matches receive a ×1.5 score weight. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier under the legacy scoring model.

Over-Commented Block388 hits · 360 pts

Severity	File	Line	Snippet	Context
LOW	misc/highlight-cf.js	1	// ==UserScript==	COMMENT
LOW	misc/highlight.js	81	// // "最后", "第一",	COMMENT
LOW	misc/highlight.js	121	.highlight("最后", colorRed);	COMMENT
LOW	misc/atcoder/abc317/g/g_test.go	121	//in := strings.NewReader(myOutput)	COMMENT
LOW	misc/oss/oss.go	2041	// }	COMMENT
LOW	misc/oss/oss.go	2701	}	COMMENT
LOW	misc/oss/oss.go	3001	if withinBeams>>beamDouble&1 > 0 {	COMMENT
LOW	misc/luogu/P3000-3999/p3527_test.go	101	// `3 5	COMMENT
LOW	misc/luogu/P13000-13999/p13270.go	21	k++	COMMENT
LOW	misc/nowcoder/9247/c/c.go	1	package main	COMMENT
LOW	leetcode/problems/5.md	301	# (si+1)*2 = ti	COMMENT
LOW	leetcode/problems/912.md	141		COMMENT
LOW	leetcode/problems/912.md	181	}	COMMENT
LOW	leetcode/problems/912.md	261	}	COMMENT
LOW	leetcode/problems/912.md	301	j--;	COMMENT
LOW	leetcode/problems/912.md	381		COMMENT
LOW	leetcode/problems/912.md	521	// 根据 pivot 重新排列 nums	COMMENT
LOW	leetcode/problems/912.md	561	// 循环结束后	COMMENT
LOW	leetcode/problems/912.md	681	impl Solution {	COMMENT
LOW	leetcode/problems/912.md	721	i += 1;	COMMENT
LOW	leetcode/problems/611.md	121	int i = 0; // a=nums[i]	COMMENT
LOW	leetcode/problems/611.md	161	int j = k - 1; // b=nums[j]	COMMENT
LOW	leetcode/problems/611.md	261	let c = nums[k];	COMMENT
LOW	leetcode/weekly/331/d/d_test.go	21	// //return	COMMENT
LOW	leetcode/weekly/503/c/c.go	81	// n := len(nums)	COMMENT
LOW	leetcode/weekly/503/c/c.go	101	// }	COMMENT
LOW	leetcode/weekly/169/d_copy.go	1	package main	COMMENT
LOW	leetcode/weekly/169/d_copy.go	21	// words[i] = make([]byte, 7)	COMMENT
LOW	leetcode/weekly/169/d_copy.go	41	// for _, w := range words {	COMMENT
LOW	leetcode/weekly/169/d_copy.go	61	// notZero[s[0]] = true	COMMENT
LOW	leetcode/weekly/169/d_copy.go	81	// col, res := col[:len(col)-1], col[len(col)-1]	COMMENT
LOW	leetcode/weekly/169/d_copy.go	101	// return f(0)	COMMENT
LOW	leetcode/weekly/462/d/d.go	181	}	COMMENT
LOW	leetcode/weekly/462/d/d.go	201	//// 枚举正中间填 midD	COMMENT
LOW	leetcode/weekly/180/d_test.go	21	}	COMMENT
LOW	leetcode/weekly/180/d/d_test.go	21	}	COMMENT
LOW	leetcode/weekly/511/d/d.go	21	}	COMMENT
LOW	leetcode/weekly/511/d/README.md	21	j = 1 # 指向需要和 i 比较的子串的首字母下标	COMMENT
LOW	leetcode/weekly/511/d/README.md	141	// 从 i 开始比从 j 开始更小（排除 j）	COMMENT
LOW	leetcode/weekly/511/d/README.md	181	// 暴力比较：是 i 开头的字典序小，还是 j 开头的字典序小？	COMMENT
LOW	leetcode/weekly/511/d/README.md	341	# s 是个周期字符串，周期为 j-i	COMMENT
LOW	leetcode/weekly/511/d/README.md	421	k++;	COMMENT
LOW	leetcode/weekly/511/d/README.md	481		COMMENT
LOW	leetcode/weekly/509/d/d.go	1	package main	COMMENT
LOW	leetcode/weekly/509/d/d.go	21	// 可以得到其在 s 中对应的回文子数组的区间为 [(i-halfLen[i])/2, (i+halfLen[i])/2-2]，用这个结论去计算子数组和	COMMENT
LOW	leetcode/weekly/509/d/README.md	161	// half_len[i] 表示在 t 上的以 t[i] 为回文中心的最长回文子串的回文半径	COMMENT
LOW	leetcode/weekly/360/d/d.go	41	// deg := make([]int, n) // g 上每个节点的入度	COMMENT
LOW	leetcode/weekly/360/d/d.go	61	// w := g[v] // v 只有一条出边	COMMENT
LOW	leetcode/weekly/360/d/d.go	81	// }	COMMENT
LOW	leetcode/weekly/360/d/d.go	101	// var rdfs func(int, int)	COMMENT
LOW	leetcode/weekly/278/d/d_test.go	41	// for _, v := range b {	COMMENT
LOW	leetcode/weekly/278/d/d_test.go	61	// merge := func(from, to int) bool {	COMMENT
LOW	leetcode/weekly/278/d/d_test.go	81	// keys = append(keys, k)	COMMENT
LOW	leetcode/weekly/278/d/d_test.go	101	// if merge(m, m^(1<<i)\|(1<<j)) {	COMMENT
LOW	leetcode/weekly/278/d/d_test.go	121	// }	COMMENT
LOW	leetcode/weekly/420/d/README.md	41	dfsStr[time] = s[x] # 后序遍历	COMMENT
LOW	leetcode/weekly/489/c/README.md	261	// 具体地，闭区间 [i-halfLen[i]+1, i+halfLen[i]-1] 是 t 上的一个回文子串	COMMENT
LOW	leetcode/weekly/489/c/c.go	81	// 相当于 sa 的反函数，即 rank[sa[i]] = i	COMMENT
LOW	leetcode/weekly/458/d/d_test.go	21	// inputGenerator := func() (n int, es [][]int, label string) {	COMMENT
LOW	leetcode/weekly/319/d/README.md	321	# 将 s 改造为 t，这样就不需要讨论 len(s) 的奇偶性，因为新串 t 的每个回文子串都是奇回文串（都有回文中心）	COMMENT
328 more matches not shown…

Hyper-Verbose Identifiers2 hits · 2 pts

Severity	File	Line	Snippet	Context
LOW	leetcode/weekly/465/d/README.md	97	def count_increasing_subsequence(b: List[int], g: int) -> int:	CODE
LOW	leetcode/weekly/465/d/README.md	528	def count_increasing_subsequence(b: List[int]) -> int:	CODE