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 20, 2026 00:36olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:55Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:55055,948,13337,832,0008,485,00024,576expected "74600294196621100 ", got "36672108831101228 "
2Jul 7, 2026 05:55055,509,57137,731,0008,236,00024,576expected "74600294196621100 ", got "47749410238965804 "
3Jul 7, 2026 05:55055,267,35238,586,0007,118,00024,576expected "74600294196621100 ", got "46990568971781420 "
4Mar 20, 2026 00:365,77374,512,44844,925,0002,995,0002,285,568
5Mar 20, 2026 00:365,80270,229,42243,138,0005,016,0002,494,464
6Mar 20, 2026 00:365,83470,417,21443,380,0005,044,0002,424,832