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 00:04Andrew EpsteinAndrew EpsteinScore: 5,285Success
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 00:055,25653,973,54541,449,0002,176,0002,121,728stderr
2Sep 17, 2026 00:055,27054,143,49941,583,0002,158,0002,121,728stderr
3Sep 17, 2026 00:055,27254,071,07541,564,0002,197,0002,121,728stderr
4Sep 17, 2026 00:055,28154,301,38841,543,0002,295,0002,121,728stderr
5Sep 17, 2026 00:055,28554,220,93641,826,0002,043,0002,117,632stderr
6Sep 17, 2026 00:055,28555,110,11041,572,0002,297,0002,121,728stderr
7Sep 17, 2026 00:055,29654,304,26241,694,0002,271,0002,121,728stderr
8Sep 17, 2026 00:055,40857,198,18642,838,0002,049,0002,117,632stderr
9Sep 17, 2026 00:055,45655,592,75942,238,0003,053,0002,121,728stderr