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:09boop34boop34Score: 9,126Success
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:099,09985,119,09174,523,0001,006,0002,113,536
2Jul 16, 2026 09:099,12185,388,85074,700,0001,007,0002,113,536
3Jul 16, 2026 09:099,12285,291,83374,711,0001,008,0002,113,536
4Jul 16, 2026 09:099,12585,863,03474,733,0001,009,0002,113,536
5Jul 16, 2026 09:099,12685,501,30574,746,0001,007,0002,113,536
6Jul 16, 2026 09:099,14185,464,33374,864,0001,007,0002,113,536
7Jul 16, 2026 09:099,15385,598,86574,961,0001,010,0002,113,536
8Jul 16, 2026 09:099,17485,652,07475,144,0001,006,0002,113,536
9Jul 16, 2026 09:099,34787,180,73576,579,0001,009,0002,113,536