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 1, 2026 01:09olliecrowolliecrowScore: 6,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 01:096,24865,200,03648,868,0002,991,0002,371,584
2May 1, 2026 01:096,25967,424,08048,957,0002,997,0002,355,200
3May 1, 2026 01:096,30670,186,81449,324,0003,019,0002,543,616
4May 1, 2026 01:096,31575,282,05049,398,0003,024,0002,330,624
5May 1, 2026 01:096,31667,657,95449,407,0003,024,0002,527,232
6May 1, 2026 01:096,31969,311,99548,415,0004,034,0002,531,328
7May 1, 2026 01:096,33670,490,47549,560,0003,034,0002,392,064
8May 1, 2026 01:096,34866,565,85850,670,0002,026,0002,560,000
9May 1, 2026 01:096,36873,828,51149,865,0002,991,0002,330,624