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 11, 2026 03:55Josu San MartinJosu San MartinScore: 3,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 03:553,85640,659,87730,933,0001,080,0002,113,536
2May 11, 2026 03:553,86539,814,04431,016,0001,068,0002,113,536
3May 11, 2026 03:553,87942,298,30531,090,0001,108,0002,113,536
4May 11, 2026 03:553,88939,880,71131,214,0001,067,0002,113,536
5May 11, 2026 03:553,89239,937,36831,219,0001,086,0002,113,536
6May 11, 2026 03:553,90040,941,62131,280,0001,091,0002,113,536
7May 11, 2026 03:553,91540,279,48831,424,0001,078,0002,113,536
8May 11, 2026 03:553,94240,340,27531,617,0001,106,0002,113,536
9May 11, 2026 03:554,03241,081,05932,375,0001,094,0002,113,536