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 19:34Josu 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 19:34039,740,69631,015,0001,092,0002,113,536expected "53682711660833364 ", got "53682711404833364 "
2May 10, 2026 19:343,85239,767,16630,890,0001,085,0002,113,536
3May 10, 2026 19:343,87341,279,32631,082,0001,069,0002,113,536
4May 10, 2026 19:343,87641,372,18631,079,0001,097,0002,113,536
5May 10, 2026 19:343,87640,492,79431,112,0001,065,0002,113,536
6May 10, 2026 19:343,87839,484,96131,118,0001,077,0002,113,536
7May 10, 2026 19:343,90143,406,12331,309,0001,074,0002,113,536
8May 10, 2026 19:343,91541,166,97331,429,0001,072,0002,113,536
9May 10, 2026 19:343,95241,475,22631,726,0001,083,0002,113,536