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 23, 2026 19:51Victor MerckléVictor MerckléScore: 3,780Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 19:523,76139,581,28030,107,0001,115,0002,117,632stderr
2Aug 23, 2026 19:523,76239,412,28130,082,0001,148,0002,117,632stderr
3Aug 23, 2026 19:523,76339,630,12730,161,0001,072,0002,117,632stderr
4Aug 23, 2026 19:523,76739,731,24330,176,0001,092,0002,117,632stderr
5Aug 23, 2026 19:523,78039,705,33430,303,0001,074,0002,117,632stderr
6Aug 23, 2026 19:523,78740,499,21830,310,0001,127,0002,117,632stderr
7Aug 23, 2026 19:523,81439,782,95330,573,0001,090,0002,117,632stderr
8Aug 23, 2026 19:523,88840,611,60631,156,0001,121,0002,117,632stderr
9Aug 23, 2026 19:523,90440,593,33631,254,0001,154,0002,117,632stderr