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 14, 2026 19:10wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:04Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:05043,248,74232,492,0002,623,0002,113,536expected "74600294196621100 ", got "72760430401850924 "
2Jul 6, 2026 23:05043,217,60932,609,0002,498,0002,113,536expected "74600294196621100 ", got "72754352198008620 "
3Jul 6, 2026 23:05045,931,97834,186,0003,632,0002,113,536expected "74600294196621100 ", got "73522541153830700 "
4Mar 14, 2026 19:044,27163,667,96834,440,0001,012,0002,486,272
5Mar 14, 2026 19:044,27353,491,46734,453,0001,013,0002,273,280
6Mar 14, 2026 19:104,27360,399,05434,453,0001,013,0002,498,560
7Mar 14, 2026 19:044,27758,167,20634,487,0001,014,0002,273,280
8Mar 14, 2026 19:104,29464,263,14134,620,0001,018,0002,494,464
9Mar 14, 2026 19:104,68964,577,19636,922,0001,995,0002,486,272