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 listJun 8, 2026 07:05anboto1anboto1Score: 5,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 07:065,521191,402,045171,923,00010,294,0002,117,632
2Jun 8, 2026 07:065,530191,851,841172,213,00010,303,0002,117,632
3Jun 8, 2026 07:065,535191,958,782172,422,00010,260,0002,117,632
4Jun 8, 2026 07:065,542192,100,398172,641,00010,272,0002,117,632
5Jun 8, 2026 07:065,554192,550,914173,106,00010,206,0002,117,632
6Jun 8, 2026 07:065,569193,039,152173,475,00010,313,0002,117,632
7Jun 8, 2026 07:065,595193,945,654174,259,00010,401,0002,117,632
8Jun 8, 2026 07:065,598193,922,881174,378,00010,378,0002,117,632
9Jun 8, 2026 07:065,617195,199,582175,464,0009,908,0002,117,632