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 03:52Kevin HeaveyKevin HeaveyScore: 3,786Success
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 04:023,66040,145,52629,333,0001,047,0002,113,536
2Jul 17, 2026 04:023,69640,514,14529,629,0001,055,0002,113,536
3Jul 17, 2026 04:023,70041,411,37629,590,0001,127,0002,113,536
4Jul 17, 2026 04:023,75140,967,00530,097,0001,043,0002,113,536
5Jul 17, 2026 04:023,78641,237,57630,385,0001,046,0002,113,536
6Jul 17, 2026 04:023,78841,350,11730,292,0001,149,0002,113,536
7Jul 17, 2026 04:023,91142,248,70231,417,0001,045,0002,113,536
8Jul 17, 2026 04:023,93642,555,26631,631,0001,045,0002,113,536
9Jul 17, 2026 04:023,96046,526,67231,833,0001,042,0002,113,536