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 20, 2026 19:03Ondřej PolaneckýOndřej PolaneckýScore: 9,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2026 19:049,44487,917,85877,345,0001,047,0002,113,536
2Jul 20, 2026 19:049,44888,119,27377,229,0001,196,0002,113,536
3Jul 20, 2026 19:049,45988,088,55977,476,0001,034,0002,113,536
4Jul 20, 2026 19:049,46388,158,91977,483,0001,062,0002,113,536
5Jul 20, 2026 19:049,46688,241,94877,507,0001,069,0002,113,536
6Jul 20, 2026 19:049,48888,368,59577,735,0001,016,0002,113,536
7Jul 20, 2026 19:049,49288,408,28677,724,0001,061,0002,113,536
8Jul 20, 2026 19:049,49288,270,00477,773,0001,017,0002,113,536
9Jul 20, 2026 19:049,49688,472,20577,765,0001,053,0002,113,536