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 listMay 10, 2026 03:25Josu San MartinJosu San MartinScore: 4,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 03:264,51853,132,88636,418,0001,082,0002,551,808
2May 10, 2026 03:264,52655,138,83636,432,0001,142,0002,547,712
3May 10, 2026 03:264,53653,830,30936,529,0001,126,0002,560,000
4May 10, 2026 03:264,54252,926,83036,599,0001,105,0002,551,808
5May 10, 2026 03:264,54554,668,90836,702,0001,023,0002,551,808
6May 10, 2026 03:264,54554,988,92036,698,0001,029,0002,547,712
7May 10, 2026 03:264,54951,803,46536,659,0001,099,0002,322,432
8May 10, 2026 03:264,55652,994,82536,781,0001,034,0002,547,712
9May 10, 2026 03:264,57254,092,58736,922,0001,033,0002,560,000