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 6, 2021 17:40Yuriy LyfenkoYuriy LyfenkoScore: 18,093Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2021 17:4013,551406,521,281884,699,95202,510,848
2Jun 6, 2021 17:4017,628528,840,2841,025,268,91002,437,120
3Jun 6, 2021 17:4017,977539,315,5601,030,202,64202,490,368
4Jun 6, 2021 17:4018,025540,756,5691,008,040,07702,502,656
5Jun 6, 2021 17:4018,093542,775,6181,011,441,04602,560,000
6Jun 6, 2021 17:4018,116543,477,9281,024,841,49502,420,736
7Jun 6, 2021 17:4018,267548,018,0001,028,985,04702,555,904
8Jun 6, 2021 17:4018,378551,340,7091,027,183,84602,453,504
9Jun 6, 2021 17:4018,622558,668,0161,014,206,71602,428,928