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 12, 2026 13:25Victor MerckléVictor MerckléScore: 3,789Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 13:253,76239,710,86730,098,0001,128,0002,117,632stderr
2Aug 12, 2026 13:253,76439,671,19430,043,0001,203,0002,117,632stderr
3Aug 12, 2026 13:253,76639,673,82530,149,0001,117,0002,117,632stderr
4Aug 12, 2026 13:253,78839,864,67830,355,0001,091,0002,117,632stderr
5Aug 12, 2026 13:253,78940,104,15230,360,0001,092,0002,117,632stderr
6Aug 12, 2026 13:253,79439,734,86930,373,0001,119,0002,117,632stderr
7Aug 12, 2026 13:253,79639,855,94830,415,0001,093,0002,117,632stderr
8Aug 12, 2026 13:253,81440,092,47930,573,0001,088,0002,117,632stderr
9Aug 12, 2026 13:253,84740,309,63430,861,0001,077,0002,117,632stderr