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 13, 2026 15:53Victor MerckléVictor MerckléScore: 7,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 15:537,87873,442,26964,385,0001,003,0002,113,536
2May 13, 2026 15:537,88672,804,12864,416,0001,040,0002,113,536
3May 13, 2026 15:537,88775,060,68764,461,0001,003,0002,113,536
4May 13, 2026 15:537,88974,182,76764,476,0001,007,0002,113,536
5May 13, 2026 15:537,89174,180,49464,478,0001,020,0002,113,536
6May 13, 2026 15:537,89375,000,38764,506,0001,011,0002,113,536
7May 13, 2026 15:537,89672,936,95564,487,0001,055,0002,113,536
8May 13, 2026 15:537,90174,657,81364,530,0001,056,0002,113,536
9May 13, 2026 15:537,90680,778,67764,609,0001,017,0002,113,536