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 18, 2026 16:04Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:59Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:59043,652,90232,894,0001,197,0002,117,632expected "74600294196621100 ", got "20786062482452268 "
2Jul 6, 2026 23:59042,067,62833,122,0001,010,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
3Jul 6, 2026 23:59042,336,01733,445,0001,020,0002,117,632expected "74600294196621100 ", got "20598630250622764 "
4Apr 18, 2026 16:044,28360,703,46134,532,0001,015,0002,273,280
5Apr 19, 2026 02:324,28860,759,20434,577,0001,016,0002,473,984
6Apr 19, 2026 02:324,29062,938,79234,590,0001,017,0002,531,328
7Apr 18, 2026 16:044,31760,766,47833,844,0001,990,0002,469,888
8Apr 18, 2026 16:044,31858,890,66733,847,0001,991,0002,535,424
9Apr 19, 2026 02:324,32063,667,99935,853,00002,531,328