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 17:30Victor MerckléVictor MerckléScore: 5,803Success
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 17:315,77756,551,45646,889,0001,062,0002,113,536
2May 24, 2026 17:315,78356,418,55746,951,0001,055,0002,113,536
3May 24, 2026 17:315,78955,855,67246,986,0001,063,0002,113,536
4May 24, 2026 17:315,79257,754,90047,011,0001,068,0002,113,536
5May 24, 2026 17:315,80357,903,58247,153,0001,019,0002,113,536
6May 24, 2026 17:315,80358,345,92447,167,0001,006,0002,113,536
7May 24, 2026 17:315,81458,025,86247,219,0001,039,0002,113,536
8May 24, 2026 17:315,82956,283,06847,307,0001,080,0002,113,536
9May 24, 2026 17:315,85156,346,43247,535,0001,036,0002,113,536