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 16:51Yurkov AlekseyYurkov AlekseyScore: 127,588Success
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 16:51121,2223,636,664,6968,590,096,40802,502,656
2Jun 7, 2021 16:51123,7123,711,346,4808,856,377,05802,424,832
3Jun 7, 2021 16:51127,2143,816,408,3939,057,493,11202,506,752
4Jun 7, 2021 16:51127,5883,827,643,6509,194,149,37602,609,152
5Jun 7, 2021 16:51128,3943,851,822,0199,168,666,57702,592,768
6Jun 7, 2021 16:51132,9703,989,088,6539,586,796,58702,572,288