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 listJul 17, 2026 16:06Kevin HeaveyKevin HeaveyScore: 3,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 16:113,65740,222,77029,305,0001,053,0002,117,632
2Jul 17, 2026 16:113,66940,213,96929,406,0001,049,0002,117,632
3Jul 17, 2026 16:113,73740,741,68229,979,0001,046,0002,117,632
4Jul 17, 2026 16:113,78241,251,36230,345,0001,051,0002,117,632
5Jul 17, 2026 16:113,81141,357,51730,581,0001,052,0002,117,632
6Jul 17, 2026 16:113,81341,457,19630,607,0001,044,0002,117,632
7Jul 17, 2026 16:113,82841,569,95330,758,0001,022,0002,117,632
8Jul 17, 2026 16:113,88141,924,11531,173,0001,042,0002,117,632
9Jul 17, 2026 16:113,88642,052,09831,218,0001,042,0002,117,632