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 listApr 19, 2026 04:29wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 17:45Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 17:45039,467,62529,962,0001,103,0002,113,536expected "74600294196621100 ", got "74534441568707170 "
2Jul 6, 2026 17:45039,729,21930,217,0001,013,0002,113,536expected "74600294196621100 ", got "74534439446348140 "
3Jul 6, 2026 17:45039,477,48930,075,0001,007,0002,113,536expected "74600294196621100 ", got "74534440902635170 "
4Apr 19, 2026 04:293,72351,278,03228,907,0001,993,0002,494,464
5Apr 19, 2026 04:293,72952,491,02628,951,0001,996,0002,531,328
6Apr 19, 2026 04:293,95660,181,51031,842,000995,0002,498,560