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 28, 2026 19:25Victor MerckléVictor MerckléScore: 5,740Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 19:275,70955,193,31146,292,0001,096,0002,113,536
2Jun 28, 2026 19:275,71555,256,03546,362,0001,079,0002,113,536
3Jun 28, 2026 19:275,71855,424,58446,381,0001,085,0002,113,536
4Jun 28, 2026 19:275,72355,189,00146,420,0001,087,0002,113,536
5Jun 28, 2026 19:275,74055,496,62146,573,0001,075,0002,113,536
6Jun 28, 2026 19:275,74255,487,30346,584,0001,082,0002,113,536
7Jun 28, 2026 19:275,74755,383,66246,703,0001,001,0002,113,536
8Jun 28, 2026 19:275,75255,459,66446,717,0001,031,0002,113,536
9Jun 28, 2026 19:275,75255,420,39246,708,0001,039,0002,113,536