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 02:04Victor MerckléVictor MerckléScore: 6,957Success
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 02:046,95167,158,18157,699,00002,113,536
2May 16, 2026 02:046,95466,617,76756,696,0001,027,0002,113,536
3May 16, 2026 02:046,95567,329,75256,713,0001,016,0002,113,536
4May 16, 2026 02:046,95667,944,56756,714,0001,022,0002,113,536
5May 16, 2026 02:046,95766,727,61856,702,0001,045,0002,113,536
6May 16, 2026 02:046,95766,963,88556,723,0001,021,0002,113,536
7May 16, 2026 02:046,96366,262,49856,785,0001,010,0002,113,536
8May 16, 2026 02:046,97467,290,72856,762,0001,124,0002,113,536
9May 16, 2026 02:047,00966,818,88658,176,00002,113,536