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 listDec 15, 2023 12:03Dmitrii VasilevDmitrii VasilevScore: 76,386Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2023 12:0376,221700,107,114632,630,46702,256,896
2Dec 15, 2023 12:0476,313699,700,007633,397,53902,256,896
3Dec 15, 2023 12:0476,341689,891,316633,629,95802,256,896
4Dec 15, 2023 12:0476,386706,696,795634,004,18602,256,896
5Dec 15, 2023 12:0376,414699,403,072634,238,69702,265,088
6Dec 15, 2023 12:0376,425684,645,412634,326,72302,260,992