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 9, 2026 22:52Josu San MartinJosu San MartinScore: 4,877Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 22:534,72456,626,75838,001,0001,210,0002,367,488
2May 9, 2026 22:534,79354,727,04138,573,0001,213,0002,375,680
3May 9, 2026 22:534,80658,281,24038,860,0001,033,0002,367,488
4May 9, 2026 22:534,84058,830,03538,973,0001,207,0002,371,584
5May 9, 2026 22:534,87758,517,75739,282,0001,204,0002,371,584
6May 9, 2026 22:534,88459,083,97639,317,0001,226,0002,379,776
7May 9, 2026 22:534,92257,824,64939,636,0001,217,0002,375,680
8May 9, 2026 22:534,93757,278,86039,813,0001,171,0002,363,392
9May 9, 2026 22:534,99958,497,18740,272,0001,221,0002,363,392