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 09:06boop34boop34Score: 9,335Success
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 09:079,32986,994,89976,428,0001,008,0002,113,536
2Jul 16, 2026 09:079,33187,037,73576,447,0001,007,0002,113,536
3Jul 16, 2026 09:079,33389,314,63376,459,0001,008,0002,113,536
4Jul 16, 2026 09:079,33387,030,39776,461,0001,007,0002,113,536
5Jul 16, 2026 09:079,33587,025,93576,478,0001,006,0002,113,536
6Jul 16, 2026 09:079,35687,312,62576,654,0001,009,0002,113,536
7Jul 16, 2026 09:079,53388,662,54178,118,0001,007,0002,113,536
8Jul 16, 2026 09:079,61489,381,19878,790,0001,008,0002,113,536
9Jul 16, 2026 09:079,81190,992,94280,429,0001,009,0002,113,536