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 24, 2026 12:05Victor MerckléVictor MerckléScore: 5,680Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 12:065,66857,118,63845,983,0001,067,0002,113,536
2May 24, 2026 12:065,67254,865,88046,009,0001,069,0002,113,536
3May 24, 2026 12:065,67356,581,61046,027,0001,067,0002,113,536
4May 24, 2026 12:065,67557,885,47946,046,0001,059,0002,113,536
5May 24, 2026 12:065,68057,164,27546,080,0001,065,0002,113,536
6May 24, 2026 12:065,70357,209,47946,263,0001,073,0002,113,536
7May 24, 2026 12:065,70955,148,53146,356,0001,036,0002,113,536
8May 24, 2026 12:065,72855,343,53746,510,0001,035,0002,113,536
9May 24, 2026 12:065,73258,246,13846,506,0001,072,0002,113,536