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:02Yuriy LyfenkoYuriy LyfenkoScore: 13,352Success
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:0213,086392,585,976796,666,25602,420,736
2Jun 7, 2021 16:0213,180395,397,909798,140,42202,576,384
3Jun 7, 2021 16:0213,228396,851,521797,089,92402,416,640
4Jun 7, 2021 16:0213,352400,568,934796,314,58402,568,192
5Jun 7, 2021 16:0213,631408,934,221795,714,85402,551,808
6Jun 7, 2021 16:0213,892416,759,134791,869,22602,433,024