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 11, 2026 20:30kuba1803kuba1803Score: 392,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 20:31391,4373,259,831,0293,178,862,00070,067,0002,113,536
2Jun 11, 2026 20:31391,7053,261,043,4293,181,090,00070,064,0002,113,536
3Jun 11, 2026 20:31391,8993,262,374,0883,181,696,00071,069,0002,113,536
4Jun 11, 2026 20:31391,9553,262,649,7923,182,092,00071,139,0002,113,536
5Jun 11, 2026 20:31392,0263,263,124,6963,181,717,00072,106,0002,113,536
6Jun 11, 2026 20:31392,6413,268,294,3983,187,849,00071,073,0002,113,536
7Jun 11, 2026 20:31400,0493,330,002,2553,250,346,00070,068,0002,113,536
8Jun 11, 2026 20:31401,6683,343,529,4913,261,763,00072,082,0002,113,536
9Jun 11, 2026 20:31402,7093,352,385,1273,272,420,00070,070,0002,113,536