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 14:24Victor MerckléVictor MerckléScore: 3,705Success
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 14:273,65438,938,24029,196,0001,135,0002,117,632stderr
2Aug 29, 2026 14:273,66538,613,41029,236,0001,188,0002,117,632stderr
3Aug 29, 2026 14:273,68738,914,44429,450,0001,154,0002,117,632stderr
4Aug 29, 2026 14:273,70139,767,94829,547,0001,178,0002,117,632stderr
5Aug 29, 2026 14:273,70538,903,93329,599,0001,160,0002,117,632stderr
6Aug 29, 2026 14:273,77839,495,20830,233,0001,127,0002,117,632stderr
7Aug 29, 2026 14:273,78039,682,80730,297,0001,084,0002,117,632stderr
8Aug 29, 2026 14:273,92941,585,27131,514,0001,103,0002,117,632stderr
9Aug 29, 2026 14:273,95142,339,74531,703,0001,092,0002,117,632stderr