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 18:36Josu San MartinJosu San MartinScore: 4,505Success
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 18:374,48745,745,28236,170,0001,079,0002,113,536
2Aug 30, 2026 18:374,49545,758,81336,174,0001,136,0002,113,536
3Aug 30, 2026 18:374,50045,841,41736,235,0001,123,0002,113,536
4Aug 30, 2026 18:374,50345,896,00736,243,0001,138,0002,113,536
5Aug 30, 2026 18:374,50546,576,94736,282,0001,112,0002,113,536
6Aug 30, 2026 18:374,50945,898,30036,295,0001,132,0002,113,536
7Aug 30, 2026 18:374,51045,873,98836,317,0001,119,0002,113,536
8Aug 30, 2026 18:374,51345,955,03236,326,0001,136,0002,113,536
9Aug 30, 2026 18:375,45553,781,18144,147,0001,132,0002,113,536