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 17, 2026 13:37Victor MerckléVictor MerckléScore: 6,953Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 13:396,94566,908,95756,608,0001,042,0002,113,536
2May 17, 2026 13:396,94767,538,74556,654,0001,009,0002,113,536
3May 17, 2026 13:396,94866,956,91956,627,0001,045,0002,113,536
4May 17, 2026 13:396,94965,541,16956,674,0001,003,0002,113,536
5May 17, 2026 13:396,95365,497,55956,673,0001,045,0002,113,536
6May 17, 2026 13:396,96565,175,70356,801,0001,016,0002,113,536
7May 17, 2026 13:396,97165,202,58056,846,0001,014,0002,113,536
8May 17, 2026 13:397,00567,826,15257,129,0001,020,0002,113,536
9May 17, 2026 13:397,01365,538,11657,166,0001,042,0002,113,536