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 11, 2026 21:25Victor MerckléVictor MerckléScore: 3,887Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 21:263,83940,294,52130,712,0001,157,0002,117,632stderr
2Aug 11, 2026 21:263,84440,297,74630,877,0001,035,0002,117,632stderr
3Aug 11, 2026 21:263,86740,497,87630,954,0001,149,0002,117,632stderr
4Aug 11, 2026 21:263,87440,599,60730,994,0001,168,0002,117,632stderr
5Aug 11, 2026 21:263,88740,645,44031,138,0001,126,0002,117,632stderr
6Aug 11, 2026 21:263,93141,027,74531,478,0001,150,0002,117,632stderr
7Aug 11, 2026 21:263,94241,380,74231,591,0001,131,0002,117,632stderr
8Aug 11, 2026 21:264,15042,802,76233,403,0001,049,0002,117,632stderr
9Aug 11, 2026 21:264,18444,036,02633,684,0001,051,0002,117,632stderr