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 listSep 3, 2026 17:20Victor MerckléVictor MerckléScore: 5,013Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 17:214,88048,928,84039,480,0001,032,0002,113,536
2Sep 3, 2026 17:214,90549,205,01839,660,0001,056,0002,113,536
3Sep 3, 2026 17:214,93649,460,30639,938,0001,037,0002,113,536
4Sep 3, 2026 17:214,98750,517,75540,304,0001,094,0002,113,536
5Sep 3, 2026 17:215,01350,002,61540,587,0001,022,0002,113,536
6Sep 3, 2026 17:215,01550,132,68140,580,0001,048,0002,113,536
7Sep 3, 2026 17:215,06650,493,96940,924,0001,129,0002,113,536
8Sep 3, 2026 17:215,10850,933,26241,251,0001,149,0002,113,536
9Sep 3, 2026 17:215,11851,634,80641,399,0001,085,0002,113,536