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:03Sergey StreminSergey StreminError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2021 15:2300000Error: expected "1023097 ", got "1022992 "
2Jun 8, 2021 06:0316,014480,431,2601,226,656,72502,469,888
3Jun 8, 2021 06:0316,181485,432,3891,225,471,81702,461,696
4Jun 8, 2021 06:0316,441493,237,6971,234,459,44702,478,080
5Jun 8, 2021 06:0316,553496,575,7071,233,879,52502,416,640
6Jun 8, 2021 06:0316,648499,425,8821,235,055,38002,465,792
7Jun 8, 2021 06:0317,260517,794,9631,238,380,82402,392,064