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 26, 2026 12:24Victor MerckléVictor MerckléScore: 5,184Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 12:255,14050,209,72641,583,0001,084,0002,113,536
2Jun 26, 2026 12:255,15450,447,98941,635,0001,151,0002,113,536
3Jun 26, 2026 12:255,16650,394,88541,789,0001,097,0002,113,536
4Jun 26, 2026 12:255,18151,072,76741,911,0001,094,0002,113,536
5Jun 26, 2026 12:255,18451,101,22341,936,0001,098,0002,113,536
6Jun 26, 2026 12:255,18450,661,55041,985,0001,043,0002,113,536
7Jun 26, 2026 12:255,25651,289,23142,493,0001,132,0002,113,536
8Jun 26, 2026 12:255,40552,630,31043,854,0001,009,0002,113,536
9Jun 26, 2026 12:255,46852,864,49844,369,0001,016,0002,113,536