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 13:46Victor MerckléVictor MerckléScore: 8,179Success
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 13:478,10175,447,87066,169,0001,072,0002,117,632stderr
2Aug 11, 2026 13:478,11175,470,13666,292,0001,030,0002,117,632stderr
3Aug 11, 2026 13:478,13075,634,13266,478,0001,007,0002,117,632stderr
4Aug 11, 2026 13:478,17276,035,22866,813,0001,016,0002,117,632stderr
5Aug 11, 2026 13:478,17976,234,42866,796,0001,093,0002,117,632stderr
6Aug 11, 2026 13:478,19476,260,95966,970,0001,046,0002,117,632stderr
7Aug 11, 2026 13:478,19476,132,65967,000,0001,017,0002,117,632stderr
8Aug 11, 2026 13:478,20076,240,89367,033,0001,032,0002,117,632stderr
9Aug 11, 2026 13:478,28776,937,36567,753,0001,032,0002,117,632stderr