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 3, 2026 22:17Tim RaddatzTim RaddatzScore: 194,027Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2026 22:18193,9466,411,129,3326,350,821,00049,397,0002,113,536
2Oct 3, 2026 22:18194,0276,414,592,2726,353,606,00049,300,0002,113,536
3Oct 3, 2026 22:18195,0356,447,334,6426,387,086,00049,074,0002,113,536