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 15, 2026 04:57Victor MerckléVictor MerckléScore: 6,964Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 04:586,95967,365,40456,764,0001,002,0002,113,536
2May 15, 2026 04:586,96166,631,12657,782,00002,113,536
3May 15, 2026 04:586,96265,955,86056,784,0001,007,0002,113,536
4May 15, 2026 04:586,96467,957,74856,771,0001,034,0002,113,536
5May 15, 2026 04:586,96465,084,62956,770,0001,035,0002,113,536
6May 15, 2026 04:586,96666,882,01057,825,00002,113,536
7May 15, 2026 04:586,96966,002,04257,847,00002,113,536
8May 15, 2026 04:586,99666,740,38857,070,0001,004,0002,113,536
9May 15, 2026 04:587,01966,347,49257,207,0001,053,0002,113,536