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 20, 2026 09:26Victor MerckléVictor MerckléScore: 20,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 09:2720,143174,844,975166,043,0001,148,0002,113,536
2Jun 20, 2026 09:2720,187175,186,922166,510,0001,046,0002,113,536
3Jun 20, 2026 09:2720,187174,990,319166,532,0001,027,0002,113,536
4Jun 20, 2026 09:2720,222175,485,254166,786,0001,060,0002,113,536
5Jun 20, 2026 09:2720,228175,876,477166,790,0001,104,0002,113,536
6Jun 20, 2026 09:2720,277175,956,018167,270,0001,032,0002,113,536
7Jun 20, 2026 09:2720,283175,900,342167,282,0001,067,0002,113,536
8Jun 20, 2026 09:2720,294176,062,780167,392,0001,053,0002,113,536
9Jun 20, 2026 09:2720,299175,963,047167,419,0001,069,0002,113,536