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 22:51Victor MerckléVictor MerckléScore: 6,955Success
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 22:516,95167,353,21857,698,00002,113,536
2May 15, 2026 22:516,95366,995,20657,716,00002,113,536
3May 15, 2026 22:516,95466,383,20756,722,0001,001,0002,113,536
4May 15, 2026 22:516,95566,178,21756,686,0001,044,0002,113,536
5May 15, 2026 22:516,95565,051,82356,687,0001,043,0002,113,536
6May 15, 2026 22:516,95867,926,04956,743,0001,010,0002,113,536
7May 15, 2026 22:516,97765,261,68756,779,0001,131,0002,113,536
8May 15, 2026 22:517,00267,622,84857,084,0001,038,0002,113,536
9May 15, 2026 22:517,00966,370,04357,178,0001,002,0002,113,536