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 listOct 12, 2025 20:29Marco BarboneMarco BarboneScore: 163,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2025 20:29162,6025,394,944,6125,346,884,00018,988,0002,277,376
2Oct 12, 2025 20:29163,1705,412,302,7995,369,630,00014,987,0002,277,376
3Oct 12, 2025 20:29163,7155,434,709,7095,385,615,00016,983,0002,277,376