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 13, 2026 08:01wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 22:10Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 22:10041,602,73532,426,0001,086,0002,113,536expected "74600294196621100 ", got "74096939109162284 "
2Jul 6, 2026 22:10041,893,37932,725,0001,081,0002,113,536expected "74600294196621100 ", got "74100224403851820 "
3Jul 6, 2026 22:10038,212,59629,068,0001,078,0002,113,536expected "74600294196621100 ", got "72480841325678380 "
4Apr 13, 2026 08:014,16460,081,62333,545,0001,016,0002,535,424
5Apr 13, 2026 08:014,24858,260,38633,246,0002,014,0002,277,376
6Apr 13, 2026 08:014,27460,046,59734,459,0001,013,0002,277,376