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 listOct 16, 2026 19:32KacpxerKacpxerScore: 6,398Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 19:336,23463,042,93750,729,0001,018,0002,113,536
2Oct 16, 2026 19:336,25663,262,74150,912,0001,016,0002,113,536
3Oct 16, 2026 19:336,28462,828,17851,144,0001,016,0002,113,536
4Oct 16, 2026 19:336,30962,997,34751,354,0001,015,0002,113,536
5Oct 16, 2026 19:336,39863,826,58052,092,0001,015,0002,113,536
6Oct 16, 2026 19:336,45464,876,52952,557,0001,017,0002,113,536
7Oct 16, 2026 19:336,48964,582,61252,849,0001,014,0002,113,536
8Oct 16, 2026 19:336,65066,541,76954,187,0001,016,0002,113,536
9Oct 16, 2026 19:336,76066,833,61855,096,0001,013,0002,113,536