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:09Victor MerckléVictor MerckléScore: 16,114Success
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:1016,016140,628,629131,892,0001,048,0002,117,632stderr
2Jun 10, 2026 12:1016,029140,536,244131,991,0001,053,0002,117,632stderr
3Jun 10, 2026 12:1016,034140,537,925132,016,0001,073,0002,117,632stderr
4Jun 10, 2026 12:1016,077140,874,995132,385,0001,057,0002,117,632stderr
5Jun 10, 2026 12:1016,114141,189,326132,746,0001,002,0002,117,632stderr
6Jun 10, 2026 12:1016,145142,980,372132,981,0001,023,0002,117,632stderr
7Jun 10, 2026 12:1016,168141,617,854133,149,0001,052,0002,117,632stderr
8Jun 10, 2026 12:1016,200141,886,329133,332,0001,129,0002,117,632stderr
9Jun 10, 2026 12:1016,330143,218,413134,474,0001,068,0002,117,632stderr