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 5, 2026 15:13Kevin HeaveyKevin HeaveyScore: 12,120Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 15:1312,039109,476,11494,433,0005,491,0002,117,632
2Jul 5, 2026 15:1312,057109,756,81194,907,0005,169,0002,117,632
3Jul 5, 2026 15:1312,109110,109,28895,382,0005,126,0002,117,632
4Jul 5, 2026 15:1312,119110,234,35495,331,0005,262,0002,117,632
5Jul 5, 2026 15:1312,120110,243,30995,262,0005,337,0002,117,632
6Jul 5, 2026 15:1312,189110,641,46195,783,0005,393,0002,117,632
7Jul 5, 2026 15:1312,259120,987,67796,263,0005,490,0002,117,632
8Jul 5, 2026 15:1312,381120,587,24197,127,0005,640,0002,121,728
9Jul 5, 2026 15:1312,391121,695,99397,346,0005,501,0002,117,632