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 06:40wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 21:07Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 21:08042,960,87032,630,0001,080,0002,113,536expected "74600294196621100 ", got "74094902686437164 "
2Jul 6, 2026 21:08040,347,46531,085,0001,116,0002,113,536expected "74600294196621100 ", got "73578247253059372 "
3Jul 6, 2026 21:08039,534,43830,583,0001,083,0002,113,536expected "74600294196621100 ", got "73519364452143916 "
4Apr 14, 2026 06:404,19563,770,94432,828,0001,989,0002,277,376
5Apr 14, 2026 06:404,19959,750,64232,860,0001,991,0002,494,464
6Apr 14, 2026 06:404,23859,230,87033,168,0002,010,0002,502,656