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:19Kevin HeaveyKevin HeaveyScore: 3,945Success
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:433,67640,428,49929,467,0001,044,0002,113,536
2Jul 17, 2026 15:433,68040,314,33229,504,0001,045,0002,113,536
3Jul 17, 2026 15:433,69140,512,97729,593,0001,049,0002,113,536
4Jul 17, 2026 15:433,93942,547,63431,655,0001,043,0002,113,536
5Jul 17, 2026 15:433,94542,621,02631,699,0001,045,0002,113,536
6Jul 17, 2026 15:433,95942,629,68531,821,0001,042,0002,113,536
7Jul 17, 2026 15:433,96442,736,61531,851,0001,052,0002,113,536
8Jul 17, 2026 15:433,96742,778,78031,887,0001,042,0002,113,536
9Jul 17, 2026 15:433,97842,855,09731,978,0001,043,0002,113,536