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 15:22Kevin HeaveyKevin HeaveyScore: 3,788Success
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 15:553,66740,368,21029,420,0001,024,0002,113,536
2Jul 17, 2026 15:553,68440,428,52629,533,0001,048,0002,113,536
3Jul 17, 2026 15:553,70447,553,94129,697,0001,049,0002,113,536
4Jul 17, 2026 15:553,77841,210,14630,315,0001,046,0002,113,536
5Jul 17, 2026 15:553,78841,283,16630,397,0001,046,0002,113,536
6Jul 17, 2026 15:553,79041,220,64230,413,0001,044,0002,113,536
7Jul 17, 2026 15:553,87641,956,19631,125,0001,046,0002,113,536
8Jul 17, 2026 15:553,88241,989,22431,179,0001,047,0002,113,536
9Jul 17, 2026 15:553,99642,991,45132,128,0001,045,0002,113,536