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 21:59Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 00:03Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 00:03042,553,39433,569,0001,092,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
2Jul 7, 2026 00:03042,033,28033,100,0001,017,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
3Jul 7, 2026 00:03042,658,44133,541,0001,090,0002,117,632expected "74600294196621100 ", got "20786062482452268 "
4Apr 18, 2026 21:594,28559,086,74434,547,0001,016,0002,482,176
5Apr 18, 2026 21:594,31956,244,76933,855,0001,991,0002,469,888
6Apr 18, 2026 21:594,32461,421,33333,895,0001,993,0002,469,888