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 12, 2026 02:22Josu 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 12, 2026 02:23041,386,11331,207,0001,107,0002,113,536expected "53699063298486931 ", got "53699063042486931 "
2May 12, 2026 02:233,87141,419,73631,087,0001,048,0002,113,536
3May 12, 2026 02:233,87140,157,47931,049,0001,085,0002,113,536
4May 12, 2026 02:233,87541,742,18531,063,0001,107,0002,113,536
5May 12, 2026 02:233,88641,441,52031,191,0001,065,0002,113,536
6May 12, 2026 02:233,89741,908,68031,272,0001,075,0002,113,536
7May 12, 2026 02:233,95042,005,25431,774,0001,011,0002,113,536
8May 12, 2026 02:233,96141,874,38031,806,0001,071,0002,113,536
9May 12, 2026 02:233,96442,424,70331,833,0001,072,0002,113,536