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 listSep 16, 2026 22:31Victor MerckléVictor MerckléScore: 47,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 22:3247,010400,042,473389,092,0001,094,0002,117,632stderr
2Sep 16, 2026 22:3247,200401,730,689390,672,0001,091,0002,117,632stderr
3Sep 16, 2026 22:3247,208401,717,576390,830,0001,002,0002,117,632stderr
4Sep 16, 2026 22:3247,293402,393,321391,531,0001,006,0002,117,632stderr
5Sep 16, 2026 22:3247,324402,537,613391,773,0001,019,0002,117,632stderr
6Sep 16, 2026 22:3247,367403,034,675392,048,0001,104,0002,117,632stderr
7Sep 16, 2026 22:3247,399403,398,168392,404,0001,015,0002,117,632stderr
8Sep 16, 2026 22:3247,427404,863,106392,518,0001,127,0002,117,632stderr
9Sep 16, 2026 22:3247,490403,998,923393,135,0001,039,0002,117,632stderr