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 14:08Victor MerckléVictor MerckléScore: 4,587Success
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 14:084,55745,432,02036,756,0001,069,0002,113,536
2Jun 10, 2026 14:084,57345,936,30736,844,0001,114,0002,113,536
3Jun 10, 2026 14:084,57545,432,45036,885,0001,094,0002,113,536
4Jun 10, 2026 14:084,58245,631,14136,958,0001,074,0002,113,536
5Jun 10, 2026 14:084,58745,642,45737,007,0001,073,0002,113,536
6Jun 10, 2026 14:084,58847,161,72337,010,0001,074,0002,113,536
7Jun 10, 2026 14:084,59245,715,55137,092,0001,024,0002,113,536
8Jun 10, 2026 14:084,61345,925,98637,235,0001,060,0002,113,536
9Jun 10, 2026 14:084,69746,558,95737,962,0001,031,0002,113,536