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 listMar 12, 2026 17:43caandocaandoScore: 5,280Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 17:435,21165,372,27742,246,0001,005,0002,285,568
2Mar 12, 2026 17:435,27078,309,32941,751,0001,988,0002,277,376
3Mar 12, 2026 17:435,27871,232,03840,823,0002,987,0002,277,376
4Mar 12, 2026 17:435,28073,361,26441,829,0001,991,0002,285,568
5Mar 12, 2026 17:435,32776,293,10441,204,0003,014,0002,473,984
6Mar 12, 2026 17:435,39774,185,44442,801,0001,990,0002,285,568