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 22:41temporary-enlightenmenttemporary-enlightenmentScore: 41,007Success
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 22:4140,983406,366,088340,161,04402,281,472
2Aug 10, 2023 22:4141,007398,098,362340,361,18502,289,664
3Aug 10, 2023 22:4141,013410,449,545340,407,41402,289,664