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 9, 2026 16:37Victor MerckléVictor MerckléScore: 289,061Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 16:39288,5552,405,002,9802,394,006,0001,002,0002,117,632stderr
2Jul 9, 2026 16:39288,7672,404,992,8182,395,740,0001,032,0002,117,632stderr
3Jul 9, 2026 16:39288,9382,406,482,1122,397,170,0001,017,0002,117,632stderr
4Jul 9, 2026 16:39289,0192,407,086,6632,397,800,0001,059,0002,117,632stderr
5Jul 9, 2026 16:39289,0612,407,420,2022,398,029,0001,184,0002,117,632stderr
6Jul 9, 2026 16:39289,0952,407,752,4602,398,422,0001,067,0002,117,632stderr
7Jul 9, 2026 16:39289,1512,408,255,2882,398,939,0001,016,0002,117,632stderr
8Jul 9, 2026 16:39289,3182,409,613,6642,400,320,0001,024,0002,117,632stderr
9Jul 9, 2026 16:39289,3592,409,950,3262,400,684,0001,003,0002,117,632stderr