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 listAug 10, 2026 17:41Victor MerckléVictor MerckléScore: 3,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 17:413,89940,693,43431,181,0001,188,0002,117,632stderr
2Aug 10, 2026 17:413,90840,764,41731,263,0001,180,0002,117,632stderr
3Aug 10, 2026 17:413,91841,565,85331,300,0001,223,0002,117,632stderr
4Aug 10, 2026 17:413,92240,733,14931,282,0001,277,0002,117,632stderr
5Aug 10, 2026 17:413,95741,953,13631,833,0001,017,0002,117,632stderr
6Aug 10, 2026 17:413,95941,891,41831,623,0001,238,0002,117,632stderr
7Aug 10, 2026 17:413,96441,254,21431,707,0001,202,0002,117,632stderr
8Aug 10, 2026 17:414,00041,319,42532,029,0001,174,0002,117,632stderr
9Aug 10, 2026 17:414,16643,582,75833,412,0001,168,0002,117,632stderr