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 listJul 3, 2023 17:08Anılcan GülkayaAnılcan GülkayaScore: 83,246Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2023 17:0880,9972,429,923,9372,372,433,76402,437,120
2Jul 3, 2023 17:0883,2462,497,370,1592,435,209,75602,379,776
3Jul 3, 2023 17:0884,2552,527,661,9972,455,481,40202,400,256