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 listOct 13, 2024 23:44Joad NacerJoad NacerError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 00:05Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 00:05042,472,87833,225,0001,021,0002,121,728expected "74600294196621100 ", got "72448992270659372 "stderr
2Jul 7, 2026 00:05042,366,28233,205,0001,022,0002,121,728expected "74600294196621100 ", got "72448992270659372 "stderr
3Jul 7, 2026 00:05042,358,27433,244,0001,021,0002,121,728expected "74600294196621100 ", got "72448992270659372 "stderr
4Oct 13, 2024 23:444,29561,177,78834,631,0001,018,0002,535,424
5Oct 13, 2024 23:444,32459,160,69932,901,0002,991,0002,310,144
6Oct 13, 2024 23:444,32860,424,16034,924,000997,0002,273,280