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 17, 2026 13:50Andrew EpsteinAndrew EpsteinScore: 10,186Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 14:2610,10393,839,19682,785,0001,077,0002,117,632stderr
2Sep 17, 2026 14:2610,13092,891,26183,007,0001,077,0002,117,632stderr
3Sep 17, 2026 14:2610,13492,890,01083,037,0001,078,0002,117,632stderr
4Sep 17, 2026 14:2610,18093,905,36283,438,0001,058,0002,117,632stderr
5Sep 17, 2026 14:2610,18693,327,94983,483,0001,069,0002,117,632stderr
6Sep 17, 2026 14:2610,20394,723,28283,626,0001,063,0002,117,632stderr
7Sep 17, 2026 14:2610,23393,659,94083,862,0001,080,0002,117,632stderr
8Sep 17, 2026 14:2610,24494,294,58283,968,0001,058,0002,117,632stderr
9Sep 17, 2026 14:2610,27094,074,58184,179,0001,066,0002,117,632stderr