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 17, 2026 15:17Kevin HeaveyKevin HeaveyScore: 3,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 15:313,65240,134,30229,254,0001,062,0002,113,536
2Jul 17, 2026 15:313,65240,189,08029,264,0001,049,0002,113,536
3Jul 17, 2026 15:313,67640,324,48429,472,0001,046,0002,113,536
4Jul 17, 2026 15:313,69240,483,36229,621,0001,029,0002,113,536
5Jul 17, 2026 15:313,76241,080,14430,123,0001,103,0002,113,536
6Jul 17, 2026 15:313,83441,599,07030,787,0001,043,0002,113,536
7Jul 17, 2026 15:313,94942,685,08331,738,0001,046,0002,113,536
8Jul 17, 2026 15:313,96742,762,40331,882,0001,046,0002,113,536
9Jul 17, 2026 15:314,01943,216,11032,308,0001,050,0002,113,536