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 listJul 6, 2026 19:21Victor MerckléVictor MerckléScore: 5,280Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 19:225,24351,579,24342,397,0001,121,0002,117,632stderr
2Jul 6, 2026 19:225,25851,694,85242,504,0001,144,0002,117,632stderr
3Jul 6, 2026 19:225,27851,891,00042,784,0001,031,0002,117,632stderr
4Jul 6, 2026 19:225,28051,834,32842,778,0001,048,0002,117,632stderr
5Jul 6, 2026 19:225,28051,850,72142,768,0001,062,0002,117,632stderr
6Jul 6, 2026 19:225,29852,028,29942,897,0001,082,0002,117,632stderr
7Jul 6, 2026 19:225,33252,386,04143,161,0001,102,0002,117,632stderr
8Jul 6, 2026 19:225,34852,390,20743,307,0001,085,0002,117,632stderr
9Jul 6, 2026 19:225,61154,601,78645,517,0001,059,0002,117,632stderr