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 03:16Victor MerckléVictor MerckléScore: 6,992Success
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 03:176,98166,258,74457,947,00002,113,536
2May 15, 2026 03:176,98265,382,29756,935,0001,020,0002,113,536
3May 15, 2026 03:176,98367,047,64157,964,00002,113,536
4May 15, 2026 03:176,98669,786,87857,991,00002,113,536
5May 15, 2026 03:176,99267,121,90957,021,0001,015,0002,113,536
6May 15, 2026 03:177,03365,691,28558,382,00002,113,536
7May 15, 2026 03:177,03566,236,53658,398,00002,113,536
8May 15, 2026 03:177,03966,662,73858,430,00002,113,536
9May 15, 2026 03:177,13366,516,38158,197,0001,010,0002,113,536