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:24Victor MerckléVictor MerckléScore: 12,395Success
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:2712,333110,181,357101,350,0001,015,0002,117,632stderr
2Jun 10, 2026 12:2712,359110,587,980101,577,0001,008,0002,117,632stderr
3Jun 10, 2026 12:2712,378110,383,211101,624,0001,115,0002,117,632stderr
4Jun 10, 2026 12:2712,384110,395,608101,687,0001,103,0002,117,632stderr
5Jun 10, 2026 12:2712,395110,631,434101,875,0001,010,0002,117,632stderr
6Jun 10, 2026 12:2712,412110,630,103102,010,0001,015,0002,117,632stderr
7Jun 10, 2026 12:2712,452111,314,962102,334,0001,019,0002,117,632stderr
8Jun 10, 2026 12:2712,472111,177,285102,506,0001,015,0002,117,632stderr
9Jun 10, 2026 12:2712,822114,114,546105,407,0001,017,0002,117,632stderr