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 listSep 14, 2026 12:25Victor MerckléVictor MerckléScore: 91,253Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 12:3190,717762,971,594751,916,0001,037,0002,117,632stderr
2Sep 14, 2026 12:3190,725762,813,805752,019,0001,003,0002,117,632stderr
3Sep 14, 2026 12:3190,839764,397,801752,915,0001,052,0002,117,632stderr
4Sep 14, 2026 12:3191,041765,539,014754,594,0001,050,0002,117,632stderr
5Sep 14, 2026 12:3191,253767,420,476756,388,0001,014,0002,117,632stderr
6Sep 14, 2026 12:3191,370769,028,078757,319,0001,059,0002,117,632stderr
7Sep 14, 2026 12:3191,905772,926,619761,800,0001,014,0002,117,632stderr
8Sep 14, 2026 12:3191,973773,763,363762,371,0001,010,0002,117,632stderr
9Sep 14, 2026 12:3191,998773,404,185762,494,0001,096,0002,117,632stderr