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 10, 2026 03:56Josu San MartinJosu San MartinScore: 4,426Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 03:574,40851,962,29735,488,0001,099,0002,535,424
2May 10, 2026 03:574,41151,917,09335,531,0001,082,0002,543,616
3May 10, 2026 03:574,41653,751,38735,542,0001,115,0002,551,808
4May 10, 2026 03:574,41950,698,14335,587,0001,092,0002,547,712
5May 10, 2026 03:574,42654,599,18235,698,0001,041,0002,560,000
6May 10, 2026 03:574,43849,084,54435,664,0001,177,0002,547,712
7May 10, 2026 03:574,44050,338,65035,674,0001,178,0002,543,616
8May 10, 2026 03:574,44652,565,79635,881,0001,026,0002,551,808
9May 10, 2026 03:574,47052,946,20436,057,0001,051,0002,551,808