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 20, 2025 07:41sheryllynn24sheryllynn24Score: 12,644Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2025 07:4112,607129,699,346103,629,0001,006,0002,260,992
2Sep 20, 2025 07:4112,623133,002,742102,774,0001,995,0002,510,848
3Sep 20, 2025 07:4112,623133,604,645102,777,0001,995,0002,285,568
4Sep 20, 2025 07:4112,629132,145,388104,821,00002,285,568
5Sep 20, 2025 07:4112,644132,463,078102,950,0001,999,0002,285,568
6Sep 20, 2025 07:4112,667131,306,834103,131,0002,002,0002,285,568
7Sep 20, 2025 07:4112,677136,503,024103,217,0002,004,0002,285,568
8Sep 20, 2025 07:4112,693134,496,648103,347,0002,006,0002,285,568
9Sep 20, 2025 07:4112,728141,565,803105,640,00002,510,848