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 22, 2026 21:23Kevin HeaveyKevin HeaveyScore: 3,828Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 21:233,71540,789,10229,812,0001,026,0002,113,536
2Jul 22, 2026 21:233,74941,115,15030,065,0001,056,0002,113,536
3Jul 22, 2026 21:233,77541,259,98130,309,0001,031,0002,113,536
4Jul 22, 2026 21:233,81041,558,01130,580,0001,049,0002,113,536
5Jul 22, 2026 21:233,82841,800,08730,718,0001,062,0002,117,632
6Jul 22, 2026 21:233,85942,021,33629,948,0002,087,0002,113,536
7Jul 22, 2026 21:2357,739489,262,859478,234,0001,007,0002,113,536
8Jul 22, 2026 21:2358,946499,235,294488,255,0001,002,0002,113,536
9Jul 22, 2026 21:2365,582554,340,679543,330,0001,003,0002,113,536