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:33Josu San MartinJosu San MartinScore: 4,449Success
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:334,41952,546,46735,557,0001,123,0002,555,904
2May 10, 2026 03:334,42053,161,66535,585,0001,104,0002,555,904
3May 10, 2026 03:334,42549,736,15235,614,0001,121,0002,547,712
4May 10, 2026 03:334,42752,624,23835,641,0001,107,0002,551,808
5May 10, 2026 03:334,44950,805,51435,855,0001,075,0002,555,904
6May 10, 2026 03:334,45653,337,09135,934,0001,052,0002,547,712
7May 10, 2026 03:334,46352,817,61635,942,0001,108,0002,551,808
8May 10, 2026 03:334,47253,166,25836,099,0001,019,0002,551,808
9May 10, 2026 03:334,49655,482,95036,260,0001,058,0002,547,712