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 listSep 12, 2026 16:10Kevin HeaveyKevin HeaveyScore: 3,901Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 16:113,64340,434,19029,038,0001,199,0002,117,632
2Sep 12, 2026 16:113,66640,663,37129,373,0001,055,0002,117,632
3Sep 12, 2026 16:113,74441,369,37729,855,0001,222,0002,117,632
4Sep 12, 2026 16:113,76441,543,35430,200,0001,042,0002,117,632
5Sep 12, 2026 16:113,90142,666,51431,156,0001,229,0002,117,632
6Sep 12, 2026 16:113,91942,732,03431,493,0001,038,0002,117,632
7Sep 12, 2026 16:113,92242,838,62531,519,0001,039,0002,117,632
8Sep 12, 2026 16:113,93642,858,09031,632,0001,037,0002,117,632
9Sep 12, 2026 16:113,94543,023,49831,515,0001,229,0002,117,632