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 16, 2026 17:06boop34boop34Score: 9,022Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 17:078,98884,152,56073,592,0001,011,0002,113,536
2Jul 16, 2026 17:079,00284,282,42873,711,0001,006,0002,113,536
3Jul 16, 2026 17:079,00684,348,69573,747,0001,008,0002,113,536
4Jul 16, 2026 17:079,01084,350,25373,750,0001,038,0002,113,536
5Jul 16, 2026 17:079,02284,531,92873,873,0001,010,0002,113,536
6Jul 16, 2026 17:079,06884,798,10774,256,0001,011,0002,113,536
7Jul 16, 2026 17:079,11585,358,40874,649,0001,006,0002,113,536
8Jul 16, 2026 17:079,20485,929,52475,382,0001,015,0002,113,536
9Jul 16, 2026 17:079,24686,354,49875,740,0001,005,0002,113,536