Unique strings Sergey Svistunov

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 5, 2023 21:21Radek SzymanskiRadek SzymanskiScore: 354,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2023 21:21353,34311,716,272,76811,660,302,52102,232,320
2Jul 5, 2023 21:21354,42011,769,939,03811,695,859,71902,281,472
3Jul 5, 2023 21:21356,84211,842,381,80711,775,784,48402,289,664