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 10:37wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 21:18Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 21:20037,233,84328,080,0001,086,0002,113,536expected "74600294196621100 ", got "72473247510456108 "
2Jul 6, 2026 21:20037,122,52627,959,0001,072,0002,113,536expected "74600294196621100 ", got "72979699186251052 "
3Jul 6, 2026 21:20038,772,09729,502,0001,107,0002,113,536expected "74600294196621100 ", got "72495813863534636 "
4Apr 14, 2026 10:374,07561,597,37531,836,0001,989,0002,498,560
5Apr 14, 2026 10:374,21357,962,56132,974,0001,998,0002,531,328
6Apr 14, 2026 10:374,22958,002,10133,094,0002,005,0002,277,376