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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 12:273,75739,635,37230,014,0001,177,0002,117,632stderr
2Aug 12, 2026 12:273,76539,629,88530,101,0001,149,0002,117,632stderr
3Aug 12, 2026 12:273,77739,855,38630,221,0001,134,0002,117,632stderr
4Aug 12, 2026 12:273,77939,764,23330,263,0001,104,0002,117,632stderr
5Aug 12, 2026 12:273,79339,886,85230,376,0001,110,0002,117,632stderr
6Aug 12, 2026 12:273,80439,932,00030,514,0001,066,0002,117,632stderr
7Aug 12, 2026 12:273,80740,000,29530,509,0001,095,0002,117,632stderr
8Aug 12, 2026 12:273,81642,255,96730,599,0001,076,0002,117,632stderr
9Aug 12, 2026 12:273,95141,185,71731,707,0001,088,0002,117,632stderr