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 19, 2026 01:55Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 00:11Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 00:11042,239,93732,931,0001,210,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
2Jul 7, 2026 00:11042,139,38333,266,0001,022,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
3Jul 7, 2026 00:11042,315,63033,373,0001,093,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
4Apr 19, 2026 01:554,33362,858,35433,965,0001,997,0002,482,176
5Apr 19, 2026 01:554,34255,198,31534,037,0002,002,0002,269,184
6Apr 19, 2026 01:554,36165,590,40334,189,0002,011,0002,269,184