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 8, 2021 06:51Sergey StreminSergey StreminScore: 16,332Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2021 06:5115,959478,768,4951,211,919,85702,482,176
2Jun 8, 2021 06:5116,299488,978,4161,219,905,74102,457,600
3Jun 8, 2021 06:5116,304489,114,5151,221,110,97302,469,888
4Jun 8, 2021 06:5116,332489,972,0381,218,397,68302,473,984
5Jun 8, 2021 06:5116,722501,655,3481,209,556,36702,347,008
6Jun 8, 2021 06:5116,762502,867,3031,218,126,71202,580,480