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:45A_ShamanA_ShamanScore: 44,295Success
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:4644,075376,625,100295,283,00070,542,0002,113,536
2Jun 19, 2026 16:4644,187376,037,639295,956,00070,799,0002,113,536
3Jun 19, 2026 16:4644,195376,175,277296,484,00070,342,0002,113,536
4Jun 19, 2026 16:4644,239376,708,245295,490,00071,697,0002,113,536
5Jun 19, 2026 16:4644,295376,890,650296,359,00071,292,0002,113,536
6Jun 19, 2026 16:4644,360377,574,903295,780,00072,408,0002,113,536
7Jun 19, 2026 16:4644,456378,392,654297,597,00071,391,0002,113,536
8Jun 19, 2026 16:4644,560379,140,504298,055,00071,795,0002,113,536
9Jun 19, 2026 16:4644,609379,236,008298,904,00071,351,0002,113,536