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:56Sergey StreminSergey StreminScore: 95,560Success
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:5694,3522,830,560,2032,772,154,88002,424,832
2Jun 6, 2021 17:5694,7842,843,507,7322,766,936,39102,404,352
3Jun 6, 2021 17:5695,1402,854,213,1002,785,295,29102,433,024
4Jun 6, 2021 17:5695,4682,864,029,0392,800,063,73702,400,256
5Jun 6, 2021 17:5695,5602,866,814,9302,794,175,63702,404,352
6Jun 6, 2021 17:5696,3612,890,820,8862,809,115,90402,420,736
7Jun 6, 2021 17:5696,3962,891,875,8332,807,931,22302,404,352
8Jun 6, 2021 17:5696,4062,892,188,9782,825,096,86002,404,352
9Jun 6, 2021 17:5697,4102,922,307,7122,848,117,42702,412,544