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 listJun 25, 2026 06:22wnwnScore: 3,994Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 06:223,92740,686,69631,591,0001,005,0002,113,536
2Jun 25, 2026 06:223,95540,469,59131,824,0001,006,0002,113,536
3Jun 25, 2026 06:223,97940,676,14931,999,0001,029,0002,113,536
4Jun 25, 2026 06:223,98041,294,55232,028,0001,010,0002,113,536
5Jun 25, 2026 06:223,99440,817,31632,146,0001,007,0002,113,536
6Jun 25, 2026 06:223,99640,898,47732,132,0001,042,0002,113,536
7Jun 25, 2026 06:224,01041,350,17132,282,0001,004,0002,113,536
8Jun 25, 2026 06:224,02341,415,30932,386,0001,006,0002,113,536
9Jun 25, 2026 06:224,03742,926,15232,507,0001,007,0002,113,536