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 13:53Victor MerckléVictor MerckléScore: 6,969Success
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 13:536,96265,557,28057,786,00002,113,536
2May 15, 2026 13:536,96668,259,53657,823,00002,113,536
3May 15, 2026 13:536,96767,067,15657,832,00002,113,536
4May 15, 2026 13:536,96767,318,70256,825,0001,005,0002,113,536
5May 15, 2026 13:536,96967,362,96256,798,0001,046,0002,113,536
6May 15, 2026 13:536,97165,263,12056,855,0001,007,0002,113,536
7May 15, 2026 13:536,97467,353,78656,881,0001,006,0002,113,536
8May 15, 2026 13:536,98665,639,55056,966,0001,025,0002,113,536
9May 15, 2026 13:537,02166,202,02357,239,0001,041,0002,113,536