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 listMar 16, 2026 23:04zielajzielajScore: 3,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 23:043,47753,329,79126,865,0001,990,0002,445,312
2Mar 16, 2026 23:043,48747,210,11026,944,0001,995,0002,437,120
3Mar 16, 2026 23:043,48853,535,74026,958,0001,996,0002,519,040
4Mar 16, 2026 23:043,49650,088,11727,018,0002,001,0002,445,312
5Mar 16, 2026 23:043,50055,799,08527,049,0002,003,0002,449,408
6Mar 16, 2026 23:043,50252,091,04427,063,0002,004,0002,523,136
7Mar 16, 2026 23:043,51950,560,87527,191,0002,014,0002,523,136
8Mar 16, 2026 23:043,52749,399,03627,256,0002,018,0002,519,040
9Mar 16, 2026 23:043,53553,917,48628,328,0001,011,0002,449,408