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 01:12Josu San MartinJosu San MartinError
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 01:12045,260,43734,042,0001,080,0002,113,536expected "53690358312413913 ", got "53690358056413913 "
2May 11, 2026 01:124,12642,024,07333,162,0001,088,0002,113,536
3May 11, 2026 01:124,14043,936,35933,208,0001,159,0002,113,536
4May 11, 2026 01:124,14442,661,62433,330,0001,070,0002,113,536
5May 11, 2026 01:124,16944,611,25233,527,0001,082,0002,113,536
6May 11, 2026 01:124,17342,357,42033,552,0001,089,0002,113,536
7May 11, 2026 01:124,19345,721,37033,693,0001,112,0002,113,536
8May 11, 2026 01:124,20743,326,88033,855,0001,071,0002,113,536
9May 11, 2026 01:124,22645,119,55533,989,0001,089,0002,113,536