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 14, 2026 09:38Victor MerckléVictor MerckléScore: 660,501Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 09:39658,3115,474,671,2505,372,174,00091,811,0002,117,632stderr
2May 14, 2026 09:39658,5735,474,234,6335,373,228,00092,932,0002,117,632stderr
3May 14, 2026 09:39659,2995,481,833,2875,381,617,00090,569,0002,117,632stderr
4May 14, 2026 09:39660,2965,491,029,6665,390,399,00090,060,0002,117,632stderr
5May 14, 2026 09:39660,5015,491,654,3135,393,300,00088,864,0002,117,632stderr
6May 14, 2026 09:39661,6925,502,537,5055,400,877,00091,172,0002,117,632stderr
7May 14, 2026 09:39663,9435,520,157,7055,423,257,00087,478,0002,117,632stderr
8May 14, 2026 09:39665,2655,529,138,0475,428,731,00092,971,0002,117,632stderr
9May 14, 2026 09:39665,4565,532,936,9065,430,628,00092,657,0002,117,632stderr