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 18:16wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:11Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:11041,636,45332,334,0001,108,0002,113,536expected "74600294196621100 ", got "42424336980854316 "
2Jul 6, 2026 23:11043,226,21533,905,0001,162,0002,113,536expected "74600294196621100 ", got "46738687636271916 "
3Jul 6, 2026 23:11041,770,57932,497,0001,168,0002,113,536expected "74600294196621100 ", got "42416146048720684 "
4Mar 14, 2026 18:164,24960,360,43434,261,0001,007,0002,498,560
5Mar 14, 2026 18:164,28055,777,83834,512,0001,015,0002,498,560
6Mar 14, 2026 18:164,28260,139,42534,524,0001,015,0002,273,280