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 13:58Victor MerckléVictor MerckléScore: 4,923Success
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 13:594,89348,814,26639,492,0001,122,0002,117,632stderr
2Aug 10, 2026 13:594,89448,827,27139,510,0001,114,0002,117,632stderr
3Aug 10, 2026 13:594,90048,831,19739,567,0001,103,0002,117,632stderr
4Aug 10, 2026 13:594,90748,935,74939,598,0001,132,0002,117,632stderr
5Aug 10, 2026 13:594,92349,147,66539,833,0001,036,0002,117,632stderr
6Aug 10, 2026 13:594,93349,108,68839,927,0001,021,0002,117,632stderr
7Aug 10, 2026 13:594,94649,233,90740,015,0001,041,0002,117,632stderr
8Aug 10, 2026 13:595,09550,711,84641,174,0001,119,0002,117,632stderr
9Aug 10, 2026 13:595,09950,558,32241,318,0001,007,0002,117,632stderr