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 15:10Victor MerckléVictor MerckléScore: 3,774Success
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 15:113,74239,453,49629,923,0001,136,0002,117,632stderr
2Aug 12, 2026 15:113,74639,573,45029,928,0001,166,0002,117,632stderr
3Aug 12, 2026 15:113,76939,715,18030,174,0001,110,0002,117,632stderr
4Aug 12, 2026 15:113,77339,710,38030,183,0001,136,0002,117,632stderr
5Aug 12, 2026 15:113,77439,756,20030,163,0001,165,0002,117,632stderr
6Aug 12, 2026 15:113,79839,973,74330,445,0001,080,0002,117,632stderr
7Aug 12, 2026 15:113,80139,951,80930,472,0001,077,0002,117,632stderr
8Aug 12, 2026 15:113,85640,404,02330,883,0001,122,0002,117,632stderr
9Aug 12, 2026 15:113,90640,910,26431,373,0001,049,0002,117,632stderr