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 10, 2026 18:51Josu 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 10, 2026 18:52041,636,24731,825,0001,115,0002,113,536expected "53684480121360423 ", got "53684479865360423 "
2May 10, 2026 18:523,96443,251,95431,799,0001,108,0002,113,536
3May 10, 2026 18:523,97741,215,08131,939,0001,077,0002,113,536
4May 10, 2026 18:523,99240,924,55232,069,0001,067,0002,113,536
5May 10, 2026 18:524,00040,613,92032,132,0001,069,0002,113,536
6May 10, 2026 18:524,00642,290,98532,119,0001,137,0002,113,536
7May 10, 2026 18:524,01342,696,93932,218,0001,095,0002,113,536
8May 10, 2026 18:524,01740,510,11932,251,0001,091,0002,113,536
9May 10, 2026 18:524,03141,237,43732,362,0001,100,0002,113,536