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 22:45Victor MerckléVictor MerckléScore: 3,917Success
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 22:463,85540,391,77830,921,0001,081,0002,117,632stderr
2Aug 12, 2026 22:463,87540,442,80231,114,0001,049,0002,117,632stderr
3Aug 12, 2026 22:463,90840,845,46231,373,0001,070,0002,117,632stderr
4Aug 12, 2026 22:463,91240,888,10731,213,0001,261,0002,117,632stderr
5Aug 12, 2026 22:463,91740,898,30431,410,0001,106,0002,117,632stderr
6Aug 12, 2026 22:463,92740,983,75331,497,0001,098,0002,117,632stderr
7Aug 12, 2026 22:463,93041,008,34531,558,0001,065,0002,117,632stderr
8Aug 12, 2026 22:463,93441,030,89331,539,0001,114,0002,117,632stderr
9Aug 12, 2026 22:463,96141,319,80331,767,0001,117,0002,117,632stderr