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 14:20Victor MerckléVictor MerckléScore: 3,777Success
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 14:203,74839,444,41330,002,0001,107,0002,117,632stderr
2Aug 12, 2026 14:203,76339,600,41330,092,0001,149,0002,117,632stderr
3Aug 12, 2026 14:203,76539,684,03430,150,0001,105,0002,117,632stderr
4Aug 12, 2026 14:203,76939,644,88630,224,0001,059,0002,117,632stderr
5Aug 12, 2026 14:203,77739,794,93130,222,0001,131,0002,117,632stderr
6Aug 12, 2026 14:203,77939,767,73230,269,0001,097,0002,117,632stderr
7Aug 12, 2026 14:203,78241,128,78330,237,0001,161,0002,117,632stderr
8Aug 12, 2026 14:203,79639,884,31230,426,0001,088,0002,117,632stderr
9Aug 12, 2026 14:203,86340,499,60430,867,0001,199,0002,117,632stderr