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 24, 2026 11:58Victor MerckléVictor MerckléScore: 6,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 11:596,21362,648,53850,506,0001,070,0002,113,536
2May 24, 2026 11:596,22660,642,42850,646,0001,030,0002,113,536
3May 24, 2026 11:596,22760,126,22650,666,0001,022,0002,113,536
4May 24, 2026 11:596,23561,257,35950,710,0001,041,0002,113,536
5May 24, 2026 11:596,23560,153,07050,703,0001,053,0002,113,536
6May 24, 2026 11:596,23659,686,97050,726,0001,037,0002,113,536
7May 24, 2026 11:596,23959,609,36750,749,0001,035,0002,113,536
8May 24, 2026 11:596,24259,610,68450,788,0001,026,0002,113,536
9May 24, 2026 11:596,25160,234,80450,886,0001,002,0002,113,536