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:45Sergey StreminSergey StreminScore: 32,754Success
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:4532,301969,041,863906,224,94502,433,024
2Jun 6, 2021 19:4532,495974,854,203914,120,16702,412,544
3Jun 6, 2021 19:4532,601978,031,048909,739,54702,416,640
4Jun 6, 2021 19:4532,754982,606,445918,364,06202,412,544
5Jun 6, 2021 19:4532,829984,876,954911,896,23102,408,448
6Jun 6, 2021 19:4533,081992,441,199912,062,76202,416,640