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 16, 2026 01:51Victor MerckléVictor MerckléScore: 6,971Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 01:516,96465,080,98256,758,0001,045,0002,113,536
2May 16, 2026 01:516,96665,828,12156,810,0001,010,0002,113,536
3May 16, 2026 01:516,96667,212,01356,808,0001,016,0002,113,536
4May 16, 2026 01:516,96966,517,50956,821,0001,028,0002,113,536
5May 16, 2026 01:516,97165,897,10456,861,0001,003,0002,113,536
6May 16, 2026 01:516,97367,275,57156,880,0001,004,0002,113,536
7May 16, 2026 01:517,02668,455,96658,321,00002,113,536
8May 16, 2026 01:517,03266,448,53658,367,00002,113,536
9May 16, 2026 01:517,03667,045,45257,303,0001,096,0002,113,536