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 07:54Victor MerckléVictor MerckléScore: 3,824Success
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 07:553,79039,912,99330,385,0001,072,0002,117,632stderr
2Aug 12, 2026 07:553,80240,029,54730,393,0001,164,0002,117,632stderr
3Aug 12, 2026 07:553,80940,039,50730,546,0001,076,0002,117,632stderr
4Aug 12, 2026 07:553,81640,076,59530,601,0001,078,0002,117,632stderr
5Aug 12, 2026 07:553,82440,155,07530,673,0001,074,0002,117,632stderr
6Aug 12, 2026 07:553,83240,204,17230,671,0001,138,0002,117,632stderr
7Aug 12, 2026 07:553,83740,262,52730,695,0001,154,0002,117,632stderr
8Aug 12, 2026 07:553,86140,444,13130,924,0001,125,0002,117,632stderr
9Aug 12, 2026 07:553,86940,525,19831,051,0001,067,0002,117,632stderr