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 listAug 30, 2026 19:30Josu San MartinJosu San MartinScore: 4,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 19:314,32244,393,46334,746,0001,132,0002,113,536
2Aug 30, 2026 19:314,32544,417,39734,751,0001,151,0002,113,536
3Aug 30, 2026 19:314,33444,444,00134,838,0001,142,0002,113,536
4Aug 30, 2026 19:314,33544,388,99734,854,0001,131,0002,113,536
5Aug 30, 2026 19:314,33544,500,31234,836,0001,147,0002,113,536
6Aug 30, 2026 19:314,34444,569,50334,929,0001,132,0002,113,536
7Aug 30, 2026 19:314,34444,618,78334,923,0001,135,0002,113,536
8Aug 30, 2026 19:314,35844,867,78635,042,0001,137,0002,113,536
9Aug 30, 2026 19:314,36444,726,20635,080,0001,146,0002,113,536