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 04:51Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 02:56Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 02:56045,253,19236,092,0001,016,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
2Jul 7, 2026 02:56046,407,50737,115,0001,035,0002,117,632expected "74600294196621100 ", got "20786187000852268 "
3Jul 7, 2026 02:56045,158,99936,018,0001,021,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
4Apr 19, 2026 04:514,62362,433,72537,361,0001,009,0002,478,080
5Apr 19, 2026 04:514,64363,477,96337,525,0001,014,0002,273,280
6Apr 19, 2026 04:514,67962,890,81037,841,000995,0002,535,424