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

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:50Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:50042,985,07233,990,0001,142,0002,117,632expected "74600294196621100 ", got "15382838469344760 "
2Jul 6, 2026 23:50042,142,73632,948,0001,120,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
3Jul 6, 2026 23:50041,955,60932,921,0001,126,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
4Apr 13, 2026 18:544,30173,568,11234,676,0001,019,0002,469,888
5Apr 13, 2026 18:544,31362,776,82333,808,0001,988,0002,273,280
6Apr 13, 2026 18:544,31762,744,97833,838,0001,990,0002,535,424