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 21, 2026 20:49A_ShamanA_ShamanScore: 53,787Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 20:5053,610454,100,368372,477,00072,489,0002,113,536
2Jun 21, 2026 20:5053,658454,448,942372,582,00072,785,0002,113,536
3Jun 21, 2026 20:5053,757455,387,848372,884,00073,305,0002,113,536
4Jun 21, 2026 20:5053,780456,703,779373,328,00073,050,0002,113,536
5Jun 21, 2026 20:5053,787455,669,410372,667,00073,770,0002,113,536
6Jun 21, 2026 20:5053,812455,694,323373,095,00073,549,0002,113,536
7Jun 21, 2026 20:5053,881456,297,644372,866,00074,352,0002,113,536
8Jun 21, 2026 20:5055,283468,011,530376,779,00082,076,0002,113,536
9Jun 21, 2026 20:5055,487469,648,112376,812,00083,736,0002,113,536