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 15:54Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:39Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:39042,087,29433,218,0001,020,0002,117,632expected "74600294196621100 ", got "20786187000852268 "
2Jul 6, 2026 23:39042,661,34533,479,0001,274,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
3Jul 6, 2026 23:39042,166,82533,037,0001,021,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
4Apr 18, 2026 15:544,28559,985,94934,552,0001,016,0002,478,080
5Apr 18, 2026 15:544,29665,629,42434,641,0001,018,0002,473,984
6Apr 18, 2026 15:544,32161,726,05434,871,000996,0002,293,760