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 10, 2026 12:34Victor MerckléVictor MerckléScore: 4,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 12:354,61845,945,56437,329,0001,006,0002,113,536
2Jun 10, 2026 12:354,62345,744,17537,329,0001,046,0002,113,536
3Jun 10, 2026 12:354,62446,005,16737,373,0001,008,0002,113,536
4Jun 10, 2026 12:354,62846,007,50637,410,0001,005,0002,113,536
5Jun 10, 2026 12:354,63246,021,02037,404,0001,045,0002,113,536
6Jun 10, 2026 12:354,63645,925,45137,345,0001,141,0002,113,536
7Jun 10, 2026 12:354,65246,187,84037,581,0001,031,0002,113,536
8Jun 10, 2026 12:354,65746,266,89437,626,0001,034,0002,113,536
9Jun 10, 2026 12:354,74347,047,98138,361,0001,007,0002,113,536