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 14, 2026 08:52wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 20:39Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 20:40037,789,99328,754,0001,016,0002,113,536expected "74600294196621100 ", got "72984185693112108 "
2Jul 6, 2026 20:40043,284,85734,267,0001,151,0002,113,536expected "74600294196621100 ", got "72405533177158700 "
3Jul 6, 2026 20:40041,057,01232,172,0001,072,0002,113,536expected "74600294196621100 ", got "74092205799133484 "
4Apr 14, 2026 08:524,04459,816,58732,548,0001,017,0002,277,376
5Apr 14, 2026 08:524,15558,640,10933,475,0001,014,0002,277,376
6Apr 14, 2026 08:524,71961,475,55637,157,0002,008,0002,490,368