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 14, 2026 02:24wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 20:04Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 20:04038,968,21630,086,0001,070,0002,113,536expected "74600294196621100 ", got "74072618779606828 "
2Jul 6, 2026 20:04037,423,32028,312,0001,144,0002,113,536expected "74600294196621100 ", got "74056808721750828 "
3Jul 6, 2026 20:04037,217,23328,364,0001,069,0002,113,536expected "74600294196621100 ", got "73752784551828012 "
4Apr 13, 2026 13:344,03757,821,72832,493,0001,015,0002,486,272
5Apr 13, 2026 13:344,04258,127,76532,536,0001,016,0002,277,376
6Apr 14, 2026 02:244,07755,729,01632,842,000995,0002,490,368
7Apr 14, 2026 02:244,09362,102,45431,975,0001,998,0002,498,560
8Apr 13, 2026 13:344,26060,843,66434,347,0001,010,0002,535,424
9Apr 14, 2026 02:244,29261,864,53634,610,0001,017,0002,490,368