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 5, 2026 13:01wnwnScore: 3,479Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 13:023,29635,877,32126,347,0001,010,0002,113,536
2Sep 5, 2026 13:023,32435,864,44426,563,0001,029,0002,113,536
3Sep 5, 2026 13:023,32536,030,13226,599,0001,001,0002,113,536
4Sep 5, 2026 13:023,47737,313,67427,828,0001,033,0002,113,536
5Sep 5, 2026 13:023,47938,067,45527,843,0001,034,0002,113,536
6Sep 5, 2026 13:023,49537,201,11227,983,0001,031,0002,113,536
7Sep 5, 2026 13:023,50038,139,54728,012,0001,044,0002,113,536
8Sep 5, 2026 13:023,50338,253,73328,078,0001,002,0002,113,536
9Sep 5, 2026 13:023,51637,645,13628,179,0001,008,0002,113,536