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 listMay 24, 2026 12:07Victor MerckléVictor MerckléScore: 5,117Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 12:085,10550,551,23741,290,0001,082,0002,113,536
2May 24, 2026 12:085,10650,227,98741,318,0001,066,0002,113,536
3May 24, 2026 12:085,10750,182,18841,326,0001,067,0002,113,536
4May 24, 2026 12:085,11152,794,01641,358,0001,068,0002,113,536
5May 24, 2026 12:085,11750,299,81341,400,0001,077,0002,113,536
6May 24, 2026 12:085,13051,064,98641,567,0001,020,0002,113,536
7May 24, 2026 12:085,13352,196,94841,611,0001,001,0002,113,536
8May 24, 2026 12:085,14251,640,63541,641,0001,041,0002,113,536
9May 24, 2026 12:085,24151,322,22142,429,0001,074,0002,113,536