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 listFeb 24, 2026 20:32Daniel MastalerzDaniel MastalerzError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 21:48Adam Folwarczny10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 21:50059,387,69947,327,0002,321,0002,113,536expected "27617841214539459 ", got "131793337824506041"
2Jul 7, 2026 21:50059,989,09748,095,0002,159,0002,113,536expected "27617841214539459 ", got "131793337824506041"
3Jul 7, 2026 21:50059,568,00447,517,0002,292,0002,113,536expected "27617841214539459 ", got "131793337824506041"
4Feb 24, 2026 20:325,41473,829,72241,941,0002,995,0002,265,088
5Feb 24, 2026 20:325,42768,013,91141,044,0004,004,0002,310,144
6Feb 24, 2026 20:325,44869,166,35041,201,0004,019,0002,265,088