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 20:41Yuriy LyfenkoYuriy LyfenkoScore: 49,121Success
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 20:4148,6441,459,334,9181,402,441,44802,494,464
2Jun 7, 2021 20:4148,8041,464,116,7521,409,072,65302,490,368
3Jun 7, 2021 20:4148,8981,466,934,9571,420,227,50902,523,136
4Jun 7, 2021 20:4149,1211,473,642,6131,411,325,42102,408,448
5Jun 7, 2021 20:4149,1431,474,291,3181,412,956,82602,457,600
6Jun 7, 2021 20:4149,2211,476,629,0351,412,589,28302,433,024