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 15, 2026 22:11Victor MerckléVictor MerckléScore: 6,983Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 22:126,97165,878,63456,848,0001,017,0002,113,536
2May 15, 2026 22:126,97467,492,87156,850,0001,038,0002,113,536
3May 15, 2026 22:126,97566,675,00656,881,0001,015,0002,113,536
4May 15, 2026 22:126,97867,089,13456,888,0001,034,0002,113,536
5May 15, 2026 22:126,98365,201,22056,953,0001,011,0002,113,536
6May 15, 2026 22:127,00177,696,84457,035,0001,080,0002,113,536
7May 15, 2026 22:127,02468,510,90457,301,0001,003,0002,113,536
8May 15, 2026 22:127,03265,733,04457,336,0001,036,0002,113,536
9May 15, 2026 22:127,03465,678,72257,378,0001,005,0002,113,536