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 23:48Victor MerckléVictor MerckléScore: 3,858Success
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 23:493,84140,317,50130,816,0001,066,0002,117,632stderr
2Aug 11, 2026 23:493,84340,270,15530,833,0001,067,0002,117,632stderr
3Aug 11, 2026 23:493,84340,385,68330,831,0001,069,0002,117,632stderr
4Aug 11, 2026 23:493,85440,426,17130,825,0001,167,0002,117,632stderr
5Aug 11, 2026 23:493,85840,437,50530,949,0001,073,0002,117,632stderr
6Aug 11, 2026 23:493,87340,544,07430,983,0001,163,0002,117,632stderr
7Aug 11, 2026 23:493,87940,558,78231,151,0001,051,0002,117,632stderr
8Aug 11, 2026 23:493,89441,820,85831,268,0001,057,0002,117,632stderr
9Aug 11, 2026 23:493,90840,842,92131,384,0001,057,0002,117,632stderr