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 12, 2026 01:08Victor MerckléVictor MerckléScore: 3,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 01:113,68141,850,39029,445,0001,110,0002,117,632stderr
2Sep 12, 2026 01:113,68841,061,79429,529,0001,086,0002,117,632stderr
3Sep 12, 2026 01:113,72441,385,63129,817,0001,095,0002,117,632stderr
4Sep 12, 2026 01:113,73740,791,58029,922,0001,101,0002,117,632stderr
5Sep 12, 2026 01:113,75041,981,56129,989,0001,139,0002,117,632stderr
6Sep 12, 2026 01:113,76040,980,29330,084,0001,125,0002,117,632stderr
7Sep 12, 2026 01:113,76440,976,80430,154,0001,090,0002,117,632stderr
8Sep 12, 2026 01:113,77241,830,36830,203,0001,105,0002,117,632stderr
9Sep 12, 2026 01:113,78341,887,10430,294,0001,111,0002,117,632stderr