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 listMar 18, 2023 19:25LiamLiamError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2023 19:2300000Error: expected "1020419 ", got "1020418 "
2Mar 18, 2023 19:2300000Error: expected "1021498 ", got "1021496 "
3Mar 18, 2023 19:2500000Error: expected "1022474 ", got "1022473 "
4Mar 18, 2023 19:2600000Error: expected "1023169 ", got "1023168 "
5Mar 18, 2023 19:2541,0911,232,726,0851,175,120,65402,318,336
6Mar 18, 2023 19:2541,2511,237,540,6741,167,388,68502,330,624
7Mar 18, 2023 19:2541,7311,251,920,0351,178,017,32402,318,336