Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJul 19, 2026 18:18Adam FolwarcznyAdam FolwarcznyScore: 11,363Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 18:1811,191102,727,51979,514,00013,374,0002,113,536
2Jul 19, 2026 18:1811,233104,746,85579,560,00013,676,0002,113,536
3Jul 19, 2026 18:1811,286104,052,62880,500,00013,182,0002,113,536
4Jul 19, 2026 18:1811,319104,382,34281,067,00012,885,0002,113,536
5Jul 19, 2026 18:1811,363104,096,04181,099,00013,218,0002,113,536
6Jul 19, 2026 18:1811,421105,132,23282,221,00012,580,0002,113,536
7Jul 19, 2026 18:1811,442105,412,83881,506,00013,470,0002,113,536
8Jul 19, 2026 18:1811,479105,182,40980,337,00014,941,0002,113,536
9Jul 19, 2026 18:1811,538106,142,31782,143,00013,628,0002,113,536