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 20, 2026 06:08M-RochatM-RochatScore: 11,804Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 06:0811,793108,182,61795,874,0002,016,0002,113,536
2May 20, 2026 06:0811,798109,057,21895,597,0002,329,0002,113,536
3May 20, 2026 06:0811,800109,582,03695,607,0002,339,0002,113,536
4May 20, 2026 06:0811,801107,319,67795,626,0002,329,0002,113,536
5May 20, 2026 06:0811,804110,226,56195,625,0002,350,0002,113,536
6May 20, 2026 06:0811,811107,546,12395,696,0002,343,0002,113,536
7May 20, 2026 06:0811,820108,199,81195,764,0002,345,0002,113,536
8May 20, 2026 06:0811,880107,983,02296,591,0002,020,0002,113,536
9May 20, 2026 06:0811,890108,883,10896,610,0002,080,0002,113,536