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 listApr 27, 2026 10:11wnwnScore: 3,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:133,37641,057,23726,027,0002,002,0002,326,528
2Apr 27, 2026 10:133,40644,045,47627,262,0001,009,0002,490,368
3Apr 27, 2026 10:133,42745,780,08128,446,00002,494,464
4Apr 27, 2026 10:133,45642,404,67227,661,0001,024,0002,494,464
5Apr 27, 2026 10:133,46644,992,26727,745,0001,027,0002,494,464
6Apr 27, 2026 10:133,48547,381,30726,935,0001,995,0002,490,368
7Apr 27, 2026 10:133,51447,124,96027,158,0002,011,0002,486,272
8Apr 27, 2026 10:133,63644,640,46629,176,0001,006,0002,490,368
9Apr 27, 2026 10:133,64545,944,83030,256,00002,486,272