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 16, 2026 04:19Victor MerckléVictor MerckléScore: 6,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 04:196,94865,009,57956,646,0001,025,0002,113,536
2May 16, 2026 04:196,95066,888,84156,663,0001,026,0002,113,536
3May 16, 2026 04:196,95167,892,61057,699,00002,113,536
4May 16, 2026 04:196,95265,112,04656,662,0001,043,0002,113,536
5May 16, 2026 04:196,95665,611,01456,728,0001,014,0002,113,536
6May 16, 2026 04:196,96265,198,29356,775,0001,013,0002,113,536
7May 16, 2026 04:197,00665,770,55157,154,0001,003,0002,113,536
8May 16, 2026 04:197,02568,394,25257,291,0001,024,0002,113,536
9May 16, 2026 04:197,10167,703,03657,921,0001,024,0002,113,536