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 listOct 24, 2026 04:27Nao MinamiNao MinamiScore: 30,577Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2026 04:2730,560264,581,988252,641,0001,009,0002,113,536
2Oct 24, 2026 04:2730,570264,721,224252,730,0001,008,0002,113,536
3Oct 24, 2026 04:2730,570264,689,930252,727,0001,010,0002,113,536
4Oct 24, 2026 04:2730,575264,679,726252,769,0001,008,0002,113,536
5Oct 24, 2026 04:2730,577266,050,384252,783,0001,008,0002,113,536
6Oct 24, 2026 04:2730,582264,701,965252,828,0001,009,0002,113,536
7Oct 24, 2026 04:2730,584264,913,408252,839,0001,009,0002,113,536
8Oct 24, 2026 04:2730,585264,982,630252,849,0001,008,0002,113,536
9Oct 24, 2026 04:2730,589265,426,749251,859,0002,031,0002,113,536