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 29, 2026 12:16Victor MerckléVictor MerckléScore: 3,969Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 12:193,95841,189,45331,760,0001,092,0002,117,632stderr
2Aug 29, 2026 12:193,96441,903,62131,803,0001,103,0002,117,632stderr
3Aug 29, 2026 12:193,96541,328,96231,797,0001,117,0002,117,632stderr
4Aug 29, 2026 12:193,96750,293,68831,820,0001,111,0002,117,632stderr
5Aug 29, 2026 12:193,96941,285,84931,864,0001,082,0002,117,632stderr
6Aug 29, 2026 12:194,00169,139,41632,126,0001,087,0002,117,632stderr
7Aug 29, 2026 12:194,14951,259,09533,422,0001,016,0002,117,632stderr
8Aug 29, 2026 12:194,17151,936,40633,579,0001,048,0002,117,632stderr
9Aug 29, 2026 12:194,25753,146,80434,212,0001,123,0002,117,632stderr