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 17, 2026 09:20Serge SmirnovSerge SmirnovScore: 29,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 09:2129,019250,123,380239,693,0001,172,0002,113,536
2Jun 17, 2026 09:2129,023250,148,349239,728,0001,171,0002,113,536
3Jun 17, 2026 09:2129,026250,208,779239,914,0001,007,0002,113,536
4Jun 17, 2026 09:2129,030250,211,246239,738,0001,218,0002,113,536
5Jun 17, 2026 09:2129,034250,588,757239,737,0001,247,0002,113,536
6Jun 17, 2026 09:2129,036250,599,407239,763,0001,240,0002,113,536
7Jun 17, 2026 09:2129,039250,644,715239,781,0001,243,0002,113,536
8Jun 17, 2026 09:2129,047254,516,547240,088,0001,008,0002,113,536
9Jun 17, 2026 09:2129,052250,839,004240,133,0001,004,0002,113,536