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 19, 2026 16:40A_ShamanA_ShamanScore: 52,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 16:4252,597445,703,352365,888,00070,673,0002,113,536
2Jun 19, 2026 16:4252,650446,316,141366,262,00070,733,0002,113,536
3Jun 19, 2026 16:4252,666446,577,457366,518,00070,614,0002,113,536
4Jun 19, 2026 16:4252,698446,818,504366,583,00070,815,0002,113,536
5Jun 19, 2026 16:4252,703447,023,765366,764,00070,677,0002,113,536
6Jun 19, 2026 16:4252,769447,119,451367,356,00070,627,0002,113,536
7Jun 19, 2026 16:4252,858447,861,113367,619,00071,110,0002,113,536
8Jun 19, 2026 16:4252,984449,254,366368,597,00071,176,0002,113,536
9Jun 19, 2026 16:4252,998449,043,894368,207,00071,681,0002,113,536