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 23, 2026 19:40Victor MerckléVictor MerckléScore: 3,887Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 19:403,75439,501,60830,032,0001,133,0002,117,632stderr
2Aug 23, 2026 19:403,76639,744,80330,064,0001,198,0002,117,632stderr
3Aug 23, 2026 19:403,78939,794,04630,266,0001,187,0002,117,632stderr
4Aug 23, 2026 19:403,79239,845,42130,288,0001,186,0002,117,632stderr
5Aug 23, 2026 19:403,88740,566,40631,147,0001,116,0002,117,632stderr
6Aug 23, 2026 19:403,93841,044,47931,600,0001,090,0002,117,632stderr
7Aug 23, 2026 19:403,96041,791,41031,713,0001,162,0002,117,632stderr
8Aug 23, 2026 19:403,96641,323,74531,859,0001,060,0002,117,632stderr
9Aug 23, 2026 19:404,14142,711,15233,327,0001,046,0002,117,632stderr