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 listAug 10, 2023 18:18temporary-enlightenmenttemporary-enlightenmentScore: 58,277Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2023 18:3258,268545,427,481483,625,52002,289,664
2Aug 10, 2023 18:1658,269542,396,861483,631,53102,285,568
3Aug 10, 2023 18:3258,272567,524,353483,659,37802,285,568
4Aug 10, 2023 18:1858,274544,680,556483,674,76402,301,952
5Aug 10, 2023 18:1658,277542,716,021483,700,59102,289,664
6Aug 10, 2023 18:1858,284542,475,261483,753,97902,281,472
7Aug 10, 2023 18:1658,288536,951,903483,791,75602,281,472
8Aug 10, 2023 18:1858,289542,647,603483,796,11502,289,664
9Aug 10, 2023 18:3258,332544,144,140484,152,36502,281,472