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 19:42Sergey StreminSergey StreminScore: 32,889Success
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 19:4232,664979,916,816917,261,35502,404,352
2Jun 6, 2021 19:4232,674980,215,015915,507,38802,412,544
3Jun 6, 2021 19:4232,732981,971,030915,865,63302,420,736
4Jun 6, 2021 19:4232,775983,240,084920,273,02802,404,352
5Jun 6, 2021 19:4232,889986,671,461914,426,64702,420,736
6Jun 6, 2021 19:4233,207996,203,040925,424,73502,400,256
7Jun 6, 2021 19:4233,320999,611,509924,034,75302,412,544
8Jun 6, 2021 19:4233,8021,014,067,154935,536,80902,400,256
9Jun 6, 2021 19:4233,8641,015,923,504929,817,19702,408,448