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 19:05Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:06Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:07046,326,38837,141,0001,095,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
2Jul 7, 2026 03:07046,440,15737,327,0001,016,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
3Jul 7, 2026 03:07045,227,07435,934,0001,196,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
4Apr 13, 2026 19:054,65763,508,54737,638,0001,017,0002,473,984
5Apr 13, 2026 19:054,69358,730,15936,957,0001,997,0002,478,080
6Apr 13, 2026 19:054,76266,591,19638,515,0001,013,0002,486,272