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 07:57wnwnScore: 3,728Success
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 07:573,70638,681,99729,760,0001,007,0002,113,536
2Jul 16, 2026 07:573,71038,782,34629,760,0001,035,0002,113,536
3Jul 16, 2026 07:573,71138,716,81429,795,0001,007,0002,113,536
4Jul 16, 2026 07:573,72738,885,78529,910,0001,026,0002,113,536
5Jul 16, 2026 07:573,72839,150,44829,928,0001,022,0002,113,536
6Jul 16, 2026 07:573,75239,293,82630,140,0001,008,0002,113,536
7Jul 16, 2026 07:573,77739,533,34030,340,0001,016,0002,113,536
8Jul 16, 2026 07:573,78939,407,29530,429,0001,022,0002,113,536
9Jul 16, 2026 07:573,79939,415,26230,521,0001,011,0002,113,536