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 listJul 14, 2026 20:45Kevin HeaveyKevin HeaveyScore: 3,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 20:463,68340,241,88829,544,0001,026,0002,117,632
2Jul 14, 2026 20:463,69140,675,50329,620,0001,022,0002,117,632
3Jul 14, 2026 20:463,69640,251,02929,643,0001,041,0002,117,632
4Jul 14, 2026 20:463,69940,271,80329,677,0001,026,0002,117,632
5Jul 14, 2026 20:463,71040,501,15329,775,0001,022,0002,117,632
6Jul 14, 2026 20:463,71241,681,46129,789,0001,027,0002,117,632
7Jul 14, 2026 20:463,71640,454,34729,819,0001,025,0002,117,632
8Jul 14, 2026 20:463,71640,485,99229,824,0001,025,0002,117,632
9Jul 14, 2026 20:465,51555,469,32444,763,0001,017,0002,117,632