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 9, 2023 08:32temporary-enlightenmenttemporary-enlightenmentScore: 64,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2023 08:3264,885602,873,252538,543,66902,256,896
2Aug 9, 2023 08:3264,892607,823,331538,604,11102,269,184
3Aug 9, 2023 08:3265,004616,763,685539,534,36102,260,992