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 24, 2026 19:44Kevin HeaveyKevin HeaveyScore: 3,789Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2026 19:453,51939,590,04327,967,0001,244,0002,113,536
2Jul 24, 2026 19:453,53139,811,13728,067,0001,241,0002,113,536
3Jul 24, 2026 19:453,66440,715,73429,172,0001,240,0002,113,536
4Jul 24, 2026 19:453,75841,512,36830,158,0001,041,0002,113,536
5Jul 24, 2026 19:453,78941,961,15430,236,0001,213,0002,113,536
6Jul 24, 2026 19:453,80341,857,10430,339,0001,231,0002,113,536
7Jul 24, 2026 19:453,80441,801,10630,532,0001,049,0002,113,536
8Jul 24, 2026 19:453,80641,982,32430,471,0001,121,0002,113,536
9Jul 24, 2026 19:453,87642,480,17931,084,0001,087,0002,113,536