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 21:01Kevin HeaveyKevin HeaveyScore: 3,583Success
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 21:023,53939,199,08228,206,0001,171,0002,113,536
2Jul 24, 2026 21:023,54139,235,22828,257,0001,141,0002,113,536
3Jul 24, 2026 21:023,57439,531,18928,504,0001,165,0002,113,536
4Jul 24, 2026 21:023,57639,541,30928,458,0001,227,0002,113,536
5Jul 24, 2026 21:023,58339,827,16528,543,0001,200,0002,113,536
6Jul 24, 2026 21:023,60839,776,29928,789,0001,161,0002,113,536
7Jul 24, 2026 21:023,69440,591,59329,513,0001,153,0002,113,536
8Jul 24, 2026 21:023,75340,977,71130,007,0001,151,0002,113,536
9Jul 24, 2026 21:023,81041,475,23530,474,0001,149,0002,113,536