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 listMar 18, 2026 03:27Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:24Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:24048,241,48436,979,0001,020,0002,113,536expected "74600294196621100 ", got "16895846256258860 "
2Jul 7, 2026 03:24047,749,84136,969,0001,020,0002,113,536expected "74600294196621100 ", got "15171594096258860 "
3Jul 7, 2026 03:24048,299,29537,018,0001,020,0002,113,536expected "74600294196621100 ", got "15171790704258860 "
4Mar 18, 2026 03:274,71066,632,75437,091,0002,004,0002,277,376
5Mar 18, 2026 03:274,82865,620,89838,073,0002,003,0002,297,856
6Mar 18, 2026 03:274,83566,088,59538,122,0002,006,0002,281,472