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 13, 2026 15:28Victor MerckléVictor MerckléScore: 7,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 13, 2026 15:287,98374,199,11065,145,0001,122,0002,113,536
2May 13, 2026 15:287,98874,808,24465,170,0001,135,0002,113,536
3May 13, 2026 15:287,98974,626,34365,182,0001,130,0002,113,536
4May 13, 2026 15:287,99076,123,12565,216,0001,109,0002,113,536
5May 13, 2026 15:287,99274,545,91065,210,0001,127,0002,113,536
6May 13, 2026 15:287,99473,593,55265,224,0001,127,0002,113,536
7May 13, 2026 15:288,00278,694,73665,272,0001,147,0002,113,536
8May 13, 2026 15:288,00575,731,49265,284,0001,163,0002,113,536
9May 13, 2026 15:288,11177,115,88966,157,0001,166,0002,113,536