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:55Josu San MartinJosu San MartinScore: 4,821Success
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:564,77353,502,44938,410,0001,214,0002,367,488
2May 9, 2026 22:564,81153,535,90638,737,0001,202,0002,371,584
3May 9, 2026 22:564,81556,692,09238,934,0001,037,0002,375,680
4May 9, 2026 22:564,82054,293,25038,789,0001,219,0002,371,584
5May 9, 2026 22:564,82159,348,75938,995,0001,024,0002,363,392
6May 9, 2026 22:564,82256,860,63438,810,0001,213,0002,375,680
7May 9, 2026 22:564,85454,406,00439,116,0001,178,0002,379,776
8May 9, 2026 22:564,99756,445,83040,280,0001,203,0002,379,776
9May 9, 2026 22:565,02658,055,99740,525,0001,199,0002,355,200