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:11boop34boop34Score: 9,139Success
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:119,11385,112,90974,632,0001,006,0002,113,536
2Jul 16, 2026 09:119,12085,342,28974,695,0001,008,0002,113,536
3Jul 16, 2026 09:119,12485,238,66274,722,0001,008,0002,113,536
4Jul 16, 2026 09:119,13585,350,70274,815,0001,007,0002,113,536
5Jul 16, 2026 09:119,13985,488,84374,851,0001,006,0002,113,536
6Jul 16, 2026 09:119,14785,437,16174,718,0001,206,0002,113,536
7Jul 16, 2026 09:119,14985,753,63074,933,0001,006,0002,113,536
8Jul 16, 2026 09:119,18385,720,17875,028,0001,198,0002,113,536
9Jul 16, 2026 09:119,50588,435,61677,886,0001,006,0002,113,536