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 24, 2026 23:19Victor MerckléVictor MerckléScore: 4,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 23:204,37244,225,96235,189,0001,106,0002,113,536
2Jun 24, 2026 23:204,37343,777,33335,160,0001,144,0002,113,536
3Jun 24, 2026 23:204,37644,294,08435,219,0001,109,0002,113,536
4Jun 24, 2026 23:204,38443,968,73735,326,0001,069,0002,113,536
5Jun 24, 2026 23:204,40344,129,64135,445,0001,103,0002,113,536
6Jun 24, 2026 23:204,40944,228,49235,499,0001,101,0002,113,536
7Jun 24, 2026 23:204,50445,114,86036,291,0001,094,0002,113,536
8Jun 24, 2026 23:204,54445,299,51736,617,0001,105,0002,113,536
9Jun 24, 2026 23:204,69746,685,36737,900,0001,091,0002,113,536