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 04:47Josu 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 04:47039,921,93231,249,0001,096,0002,113,536expected "53682442772347560 ", got "53682442516347560 "
2May 11, 2026 04:473,86142,030,74130,966,0001,083,0002,113,536
3May 11, 2026 04:473,86641,242,51431,027,0001,062,0002,113,536
4May 11, 2026 04:473,87140,517,51931,042,0001,088,0002,113,536
5May 11, 2026 04:473,87239,445,64131,075,0001,066,0002,113,536
6May 11, 2026 04:473,88440,416,11631,158,0001,081,0002,113,536
7May 11, 2026 04:473,88541,423,41031,176,0001,077,0002,113,536
8May 11, 2026 04:473,89340,162,47531,291,0001,022,0002,113,536
9May 11, 2026 04:473,93142,024,18431,545,0001,085,0002,113,536