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 26, 2026 23:14Victor MerckléVictor MerckléScore: 3,812Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 23:153,77339,749,92230,181,0001,142,0002,117,632stderr
2Aug 26, 2026 23:153,77639,714,52430,281,0001,060,0002,117,632stderr
3Aug 26, 2026 23:153,78739,771,45630,353,0001,086,0002,117,632stderr
4Aug 26, 2026 23:153,79839,855,87730,392,0001,138,0002,117,632stderr
5Aug 26, 2026 23:153,81240,047,85730,622,0001,020,0002,117,632stderr
6Aug 26, 2026 23:153,82140,076,16830,546,0001,174,0002,117,632stderr
7Aug 26, 2026 23:153,98941,511,38332,054,0001,062,0002,117,632stderr
8Aug 26, 2026 23:154,04441,995,06432,493,0001,076,0002,117,632stderr
9Aug 26, 2026 23:154,07742,972,69432,746,0001,095,0002,117,632stderr