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 11, 2026 14:32Victor MerckléVictor MerckléScore: 3,976Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 14:333,94541,117,41831,706,0001,042,0002,117,632stderr
2Aug 11, 2026 14:333,96442,439,17531,818,0001,088,0002,117,632stderr
3Aug 11, 2026 14:333,96841,310,03931,793,0001,146,0002,117,632stderr
4Aug 11, 2026 14:333,97441,368,80731,946,0001,043,0002,117,632stderr
5Aug 11, 2026 14:333,97641,412,73931,966,0001,035,0002,117,632stderr
6Aug 11, 2026 14:333,98441,445,35332,039,0001,029,0002,117,632stderr
7Aug 11, 2026 14:334,04441,973,29632,545,0001,027,0002,117,632stderr
8Aug 11, 2026 14:334,18643,804,89533,693,0001,053,0002,117,632stderr
9Aug 11, 2026 14:334,26844,305,08034,390,0001,037,0002,117,632stderr