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 15:08Victor MerckléVictor MerckléScore: 6,974Success
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 15:096,96766,988,84956,825,0001,008,0002,113,536
2May 15, 2026 15:096,96866,494,32256,841,0001,001,0002,113,536
3May 15, 2026 15:096,96866,949,22656,828,0001,008,0002,113,536
4May 15, 2026 15:096,97065,329,01856,847,0001,012,0002,113,536
5May 15, 2026 15:096,97465,539,39056,841,0001,045,0002,113,536
6May 15, 2026 15:096,98167,894,44356,894,0001,049,0002,113,536
7May 15, 2026 15:096,99167,300,91657,016,0001,014,0002,113,536
8May 15, 2026 15:097,02366,995,76157,250,0001,047,0002,113,536
9May 15, 2026 15:097,02565,619,78157,279,0001,029,0002,113,536