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 18, 2026 18:22Kevin HeaveyKevin HeaveyScore: 3,719Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 18:293,66840,266,38929,405,0001,045,0002,113,536
2Jul 18, 2026 18:293,69940,457,90029,660,0001,045,0002,113,536
3Jul 18, 2026 18:293,71540,606,44529,775,0001,061,0002,113,536
4Jul 18, 2026 18:293,71840,702,22229,772,0001,090,0002,113,536
5Jul 18, 2026 18:293,71949,601,62229,823,0001,046,0002,117,632
6Jul 18, 2026 18:293,76641,057,04430,194,0001,072,0002,113,536
7Jul 18, 2026 18:293,81641,475,83830,626,0001,047,0002,113,536
8Jul 18, 2026 18:293,85841,842,47031,002,0001,023,0002,113,536
9Jul 18, 2026 18:293,87642,030,51431,128,0001,049,0002,113,536