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:35Sergey StreminSergey StreminScore: 33,127Success
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:3532,652979,571,910921,270,12002,404,352
2Jun 6, 2021 17:3532,827984,795,591923,312,42702,416,640
3Jun 6, 2021 17:3533,061991,831,820934,838,53202,428,928
4Jun 6, 2021 17:3533,076992,291,672926,116,10902,424,832
5Jun 6, 2021 17:3533,127993,811,368924,347,04102,408,448
6Jun 6, 2021 17:3533,251997,520,433925,186,43702,408,448
7Jun 6, 2021 17:3533,3811,001,433,602918,481,95602,408,448
8Jun 6, 2021 17:3533,3951,001,860,691938,303,40702,420,736
9Jun 6, 2021 17:3533,5651,006,950,316933,633,52602,404,352