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:28Josu 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:28040,417,76431,659,0001,078,0002,113,536expected "53677222678290371 ", got "53677222422290371 "
2May 11, 2026 00:283,85839,322,21230,963,0001,062,0002,113,536
3May 11, 2026 00:283,87140,722,87731,047,0001,084,0002,113,536
4May 11, 2026 00:283,87241,856,89931,041,0001,103,0002,113,536
5May 11, 2026 00:283,87641,561,63631,103,0001,072,0002,113,536
6May 11, 2026 00:283,88142,302,11531,131,0001,086,0002,113,536
7May 11, 2026 00:283,91140,165,86131,378,0001,087,0002,113,536
8May 11, 2026 00:283,92641,520,71231,511,0001,075,0002,113,536
9May 11, 2026 00:284,00540,835,67732,179,0001,070,0002,113,536