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 24, 2026 17:27Victor MerckléVictor MerckléScore: 3,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 17:293,73739,435,78129,849,0001,169,0002,117,632stderr
2Aug 24, 2026 17:293,75439,542,06129,989,0001,174,0002,117,632stderr
3Aug 24, 2026 17:293,75940,076,10730,078,0001,128,0002,117,632stderr
4Aug 24, 2026 17:293,76739,676,32230,160,0001,111,0002,117,632stderr
5Aug 24, 2026 17:293,77039,686,09030,191,0001,101,0002,117,632stderr
6Aug 24, 2026 17:293,78239,749,10530,293,0001,104,0002,117,632stderr
7Aug 24, 2026 17:293,78339,788,86330,277,0001,129,0002,117,632stderr
8Aug 24, 2026 17:293,79439,901,04830,412,0001,084,0002,117,632stderr
9Aug 24, 2026 17:293,98741,479,31032,006,0001,094,0002,117,632stderr