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 listMay 13, 2026 19:03Victor MerckléVictor MerckléScore: 875,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 19:05875,5607,274,495,4597,266,086,0001,069,0002,117,632stderr
2May 13, 2026 19:05875,5867,276,275,9577,266,293,0001,079,0002,117,632stderr
3May 13, 2026 19:05875,6087,276,513,7217,266,527,0001,026,0002,117,632stderr
4May 13, 2026 19:05875,6937,277,559,5037,267,195,0001,064,0002,117,632stderr
5May 13, 2026 19:05875,7367,278,060,7557,267,613,0001,001,0002,117,632stderr
6May 13, 2026 19:05875,7947,277,842,4967,267,959,0001,134,0002,117,632stderr
7May 13, 2026 19:05876,3537,283,294,0467,272,730,0001,002,0002,117,632stderr
8May 13, 2026 19:05877,9777,296,384,3017,286,167,0001,048,0002,117,632stderr
9May 13, 2026 19:05878,4457,300,954,3037,290,094,0001,002,0002,117,632stderr