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 25, 2026 06:18wnwnScore: 3,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 06:183,31434,951,28426,469,0001,038,0002,113,536
2Jun 25, 2026 06:183,31634,953,32026,492,0001,033,0002,113,536
3Jun 25, 2026 06:183,31935,037,77926,524,0001,031,0002,113,536
4Jun 25, 2026 06:183,32135,160,68626,567,0001,004,0002,113,536
5Jun 25, 2026 06:183,43836,565,81227,500,0001,037,0002,113,536
6Jun 25, 2026 06:183,46836,609,00927,752,0001,038,0002,113,536
7Jun 25, 2026 06:183,47336,560,52927,824,0001,009,0002,113,536
8Jun 25, 2026 06:183,48936,943,09827,954,0001,011,0002,113,536
9Jun 25, 2026 06:183,50436,753,02428,080,0001,005,0002,113,536