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 20, 2023 07:12matsuoka-601matsuoka-601Score: 6,953Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2023 07:126,911120,969,86157,357,20202,281,472
2Dec 20, 2023 07:156,912117,605,70357,365,83902,281,472
3Dec 20, 2023 07:126,913110,183,46757,375,30302,281,472
4Dec 20, 2023 07:126,942118,828,37357,615,98302,273,280
5Dec 20, 2023 07:136,953116,920,15657,712,68902,281,472
6Dec 20, 2023 07:136,958123,888,15257,753,92602,289,664
7Dec 20, 2023 07:136,966127,346,32957,818,88002,281,472
8Dec 20, 2023 07:157,003119,393,41158,127,34702,277,376
9Dec 20, 2023 07:157,119127,649,65759,091,51002,297,856