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:30A_ShamanA_ShamanScore: 46,567Success
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:3046,471395,155,252322,958,00062,755,0002,113,536
2Jun 19, 2026 16:3046,498395,121,103322,863,00063,074,0002,113,536
3Jun 19, 2026 16:3046,546395,426,494322,997,00063,342,0002,113,536
4Jun 19, 2026 16:3046,552395,490,150323,185,00063,197,0002,113,536
5Jun 19, 2026 16:3046,567395,655,261322,797,00063,717,0002,113,536
6Jun 19, 2026 16:3046,633396,119,570323,202,00063,856,0002,113,536
7Jun 19, 2026 16:3046,648396,500,363323,572,00063,609,0002,113,536
8Jun 19, 2026 16:3046,664396,440,543323,487,00063,829,0002,113,536
9Jun 19, 2026 16:3046,684396,542,278323,177,00064,308,0002,113,536