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 00:39Josu 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 00:40048,527,08039,800,0001,088,0002,113,536expected "53686553138041648 ", got "53686552882041648 "
2May 11, 2026 00:404,86848,129,91239,349,0001,062,0002,113,536
3May 11, 2026 00:404,88248,718,20139,449,0001,074,0002,113,536
4May 11, 2026 00:404,88850,131,20939,512,0001,062,0002,113,536
5May 11, 2026 00:404,88948,386,72139,487,0001,096,0002,113,536
6May 11, 2026 00:404,89350,101,61339,519,0001,099,0002,113,536
7May 11, 2026 00:404,89448,259,72639,561,0001,062,0002,113,536
8May 11, 2026 00:404,89550,111,08639,550,0001,079,0002,113,536
9May 11, 2026 00:404,89950,564,83639,577,0001,085,0002,113,536