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 21:30wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:05Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:05042,775,38933,806,0001,071,0002,113,536expected "74600294196621100 ", got "73483736259563820 "
2Jul 6, 2026 23:05043,273,61634,099,0001,067,0002,113,536expected "74600294196621100 ", got "73483939765209900 "
3Jul 6, 2026 23:05041,542,70532,276,0001,170,0002,113,536expected "74600294196621100 ", got "72036088874738476 "
4Mar 14, 2026 21:304,26058,542,24134,349,0001,010,0002,273,280
5Mar 14, 2026 21:304,27756,544,63634,483,0001,014,0002,273,280
6Mar 14, 2026 21:304,29761,839,58734,645,0001,018,0002,498,560