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 28, 2026 15:56Victor MerckléVictor MerckléScore: 6,810Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 15:566,74564,409,64454,845,0001,143,0002,113,536
2Aug 28, 2026 15:566,74865,098,64754,912,0001,102,0002,113,536
3Aug 28, 2026 15:566,76264,525,70355,026,0001,100,0002,113,536
4Aug 28, 2026 15:566,80564,934,93155,345,0001,144,0002,113,536
5Aug 28, 2026 15:566,81064,904,08055,412,0001,116,0002,113,536
6Aug 28, 2026 15:566,82465,674,00555,535,0001,112,0002,113,536
7Aug 28, 2026 15:566,85165,188,51255,780,0001,091,0002,113,536
8Aug 28, 2026 15:566,85366,004,68555,776,0001,108,0002,113,536
9Aug 28, 2026 15:566,96666,217,35156,703,0001,116,0002,113,536