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 listJun 11, 2026 21:24Victor MerckléVictor MerckléScore: 55,073Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 21:2555,022464,141,499455,661,0001,029,0002,113,536
2Jun 11, 2026 21:2555,050464,584,989455,882,0001,036,0002,113,536
3Jun 11, 2026 21:2555,067464,708,010455,931,0001,131,0002,113,536
4Jun 11, 2026 21:2555,073464,703,569456,000,0001,113,0002,113,536
5Jun 11, 2026 21:2555,073464,882,690456,002,0001,111,0002,113,536
6Jun 11, 2026 21:2555,080464,916,754456,039,0001,126,0002,113,536
7Jun 11, 2026 21:2555,094465,002,471456,191,0001,096,0002,113,536
8Jun 11, 2026 21:2555,110465,097,319456,399,0001,019,0002,113,536
9Jun 11, 2026 21:2555,111464,984,914456,398,0001,031,0002,113,536