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 listMar 28, 2026 01:34olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:30Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:31066,707,48448,448,0002,024,0002,117,632expected "74600294196621100 ", got "53517426486514220 "
2Jul 7, 2026 05:31054,623,58435,965,0002,040,0002,117,632expected "74600294196621100 ", got "53554277788223532 "
3Jul 7, 2026 05:31056,267,79836,586,0002,035,0002,117,632expected "74600294196621100 ", got "36631593386877740 "
4Mar 28, 2026 01:345,68969,713,48746,212,0001,004,0002,506,752
5Mar 28, 2026 01:345,71870,464,27845,439,0002,019,0002,441,216
6Mar 28, 2026 01:345,72171,771,70544,451,0003,030,0002,416,640