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 17, 2026 03:30Kevin HeaveyKevin HeaveyScore: 3,776Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 03:323,70640,535,25029,741,0001,025,0002,117,632
2Jul 17, 2026 03:323,72840,746,55729,652,0001,295,0002,117,632
3Jul 17, 2026 03:323,73242,213,50029,663,0001,313,0002,117,632
4Jul 17, 2026 03:323,76941,049,72830,235,0001,048,0002,117,632
5Jul 17, 2026 03:323,77641,097,19730,044,0001,302,0002,117,632
6Jul 17, 2026 03:323,77841,057,44930,132,0001,232,0002,117,632
7Jul 17, 2026 03:323,78741,252,43030,392,0001,047,0002,117,632
8Jul 17, 2026 03:323,79641,225,13330,466,0001,048,0002,117,632
9Jul 17, 2026 03:323,80141,322,50630,512,0001,042,0002,117,632