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 listDec 27, 2024 22:11Joad NacerJoad NacerError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:19Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:19041,916,27532,863,0001,025,0002,121,728expected "74600294196621100 ", got "72448992270659372 "stderr
2Jul 6, 2026 23:19041,940,86932,844,0001,022,0002,121,728expected "74600294196621100 ", got "72448992270659372 "stderr
3Jul 6, 2026 23:19041,935,37032,773,0001,023,0002,121,728expected "74600294196621100 ", got "72448992270659372 "stderr
4Dec 27, 2024 22:114,22358,246,94433,051,0002,003,0002,314,240
5Dec 27, 2024 22:114,24261,024,65835,210,00002,400,256
6Dec 27, 2024 22:114,27655,112,44235,488,00002,310,144
7Dec 27, 2024 22:114,28253,212,66333,508,0002,030,0002,314,240
8Dec 27, 2024 22:114,31764,520,59733,843,0001,990,0002,318,336
9Dec 27, 2024 22:114,33961,288,77134,016,0002,000,0002,306,048