Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listJun 7, 2021 21:44Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2021 21:4500000Error: expected "1036347 ", got "1036348 "
2Jun 8, 2021 13:148,389251,658,359567,095,01902,543,616
3Jun 8, 2021 13:148,581257,443,006564,502,90302,514,944
4Jun 7, 2021 21:448,685260,547,677584,611,60002,469,888
5Jun 7, 2021 21:448,734262,016,502584,302,42202,555,904
6Jun 8, 2021 13:148,933267,988,872563,735,91402,478,080
7Jun 7, 2021 21:448,979269,375,096581,457,86002,396,160