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 20:44Victor MerckléVictor MerckléScore: 5,295Success
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 20:455,27752,192,77542,700,0001,106,0002,117,632stderr
2Aug 11, 2026 20:455,28251,978,30042,815,0001,029,0002,117,632stderr
3Aug 11, 2026 20:455,29152,339,97642,810,0001,111,0002,117,632stderr
4Aug 11, 2026 20:455,29152,297,96042,822,0001,095,0002,117,632stderr
5Aug 11, 2026 20:455,29553,545,55642,932,0001,022,0002,117,632stderr
6Aug 11, 2026 20:455,29752,139,67242,859,0001,108,0002,117,632stderr
7Aug 11, 2026 20:455,29852,383,97642,952,0001,025,0002,117,632stderr
8Aug 11, 2026 20:455,32552,365,64643,097,0001,106,0002,117,632stderr
9Aug 11, 2026 20:455,45153,628,58244,233,0001,011,0002,117,632stderr