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:38Josu 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:38042,148,03431,942,0001,072,0002,113,536expected "53693961474354416 ", got "53693961378539463 "
2May 10, 2026 18:383,94840,520,30331,708,0001,067,0002,113,536
3May 10, 2026 18:383,96143,303,15731,806,0001,071,0002,113,536
4May 10, 2026 18:383,96440,949,02631,838,0001,071,0002,113,536
5May 10, 2026 18:383,96942,494,24831,938,0001,010,0002,113,536
6May 10, 2026 18:383,97242,038,17931,902,0001,072,0002,113,536
7May 10, 2026 18:383,97341,472,30331,915,0001,062,0002,113,536
8May 10, 2026 18:383,99042,113,04932,055,0001,062,0002,113,536
9May 10, 2026 18:384,00444,015,23232,105,0001,131,0002,113,536