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 11:27wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 20:19Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 20:19037,356,97628,363,0001,077,0002,113,536expected "74600294196621100 ", got "72472895636356140 "
2Jul 6, 2026 20:19038,400,07329,290,0001,103,0002,113,536expected "74600294196621100 ", got "72406020353298988 "
3Jul 6, 2026 20:19039,469,98330,549,0001,119,0002,113,536expected "74600294196621100 ", got "72399165938813484 "
4Apr 13, 2026 11:274,08860,265,41631,938,0001,996,0002,277,376
5Apr 13, 2026 11:274,11859,546,69032,168,0002,010,0002,277,376
6Apr 13, 2026 11:274,11956,904,97232,175,0002,010,0002,277,376