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 listMar 18, 2026 03:34Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:09Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:09045,170,20235,902,0001,120,0002,117,632expected "74600294196621100 ", got "20567748231278380 "
2Jul 7, 2026 03:09044,853,44935,804,0001,142,0002,117,632expected "74600294196621100 ", got "22143823495278380 "
3Jul 7, 2026 03:09045,668,09536,666,0001,135,0002,117,632expected "74600294196621100 ", got "22143823495278380 "
4Mar 18, 2026 03:344,67968,393,24438,832,00002,482,176
5Mar 18, 2026 03:344,69967,336,28637,004,0002,000,0002,482,176
6Mar 18, 2026 03:344,96067,946,80539,158,0002,008,0002,473,984