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 10, 2021 16:19Yuriy LyfenkoYuriy LyfenkoScore: 16,441Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2021 16:1911,818354,554,009856,250,41802,428,928
2Jun 10, 2021 16:1911,935358,063,424855,552,33902,605,056
3Jun 10, 2021 16:1912,036361,077,696852,679,10902,494,464
4Jun 10, 2021 16:1916,441493,237,6491,299,386,94702,699,264
5Jun 10, 2021 16:1916,762502,869,7451,300,479,68402,572,288
6Jun 10, 2021 16:1917,439523,184,1041,295,260,54202,547,712