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:21Yuriy LyfenkoYuriy LyfenkoScore: 12,425Success
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:2111,711351,336,352864,238,02502,482,176
2Jun 7, 2021 16:2111,983359,483,267855,096,64702,482,176
3Jun 7, 2021 16:2112,075362,258,398856,993,42102,506,752
4Jun 7, 2021 16:2112,425372,752,032863,051,44002,494,464
5Jun 7, 2021 16:2112,510375,293,644864,545,93602,609,152
6Jun 7, 2021 16:2112,594377,822,127867,325,68002,359,296