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 28, 2026 00:29A_ShamanA_ShamanScore: 55,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 00:2955,663471,435,770461,006,0001,003,0002,113,536
2Jun 28, 2026 00:2955,671471,416,490461,074,0001,003,0002,113,536
3Jun 28, 2026 00:2955,672471,427,173461,074,0001,004,0002,113,536
4Jun 28, 2026 00:2955,673471,464,309461,085,0001,006,0002,113,536
5Jun 28, 2026 00:2955,675471,579,734461,105,0001,004,0002,113,536
6Jun 28, 2026 00:2955,698471,688,716461,284,0001,016,0002,113,536
7Jun 28, 2026 00:2955,703475,638,294461,331,0001,004,0002,113,536
8Jun 28, 2026 00:2955,708471,715,296461,372,0001,005,0002,113,536
9Jun 28, 2026 00:2955,727472,085,423461,536,0001,003,0002,113,536