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 19:29Josu San MartinJosu San MartinScore: 4,041Success
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 19:303,97140,488,93131,876,0001,085,0002,113,536
2May 10, 2026 19:303,97942,861,10931,876,0001,154,0002,113,536
3May 10, 2026 19:303,98642,999,12731,932,0001,155,0002,113,536
4May 10, 2026 19:303,99741,557,13531,968,0001,214,0002,113,536
5May 10, 2026 19:304,04141,752,72932,377,0001,164,0002,113,536
6May 10, 2026 19:304,04341,458,13632,411,0001,152,0002,113,536
7May 10, 2026 19:304,08943,003,21032,788,0001,151,0002,113,536
8May 10, 2026 19:304,09541,706,12532,800,0001,192,0002,113,536
9May 10, 2026 19:304,10644,277,73832,915,0001,165,0002,113,536