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 14, 2024 16:47Joad NacerJoad NacerError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:35Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:35042,626,58033,441,0001,021,0002,121,728expected "74600294196621100 ", got "72448992270659372 "stderr
2Jul 6, 2026 23:35042,723,12733,572,0001,025,0002,121,728expected "74600294196621100 ", got "72448992270659372 "stderr
3Jul 6, 2026 23:35042,552,73933,499,0001,021,0002,121,728expected "74600294196621100 ", got "72448992270659372 "stderr
4Oct 14, 2024 16:474,27453,171,47035,472,00002,535,424
5Oct 14, 2024 16:474,28563,679,18534,548,0001,016,0002,535,424
6Oct 14, 2024 16:474,39261,133,97434,430,0002,025,0002,297,856