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 7, 2026 17:10anboto1anboto1Score: 28,183Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 17:1127,443915,080,487899,921,0005,726,0002,113,536
2Jun 7, 2026 17:1127,538919,645,107903,195,0005,567,0002,113,536
3Jun 7, 2026 17:1127,655922,449,039907,012,0005,605,0002,113,536
4Jun 7, 2026 17:1127,926930,874,592916,049,0005,517,0002,113,536
5Jun 7, 2026 17:1128,183939,379,481924,417,0005,644,0002,113,536
6Jun 7, 2026 17:1129,146971,185,965956,181,0005,646,0002,113,536
7Jun 7, 2026 17:1129,192972,771,506957,670,0005,698,0002,113,536
8Jun 7, 2026 17:1129,258975,329,059959,889,0005,654,0002,113,536
9Jun 7, 2026 17:1129,421980,639,247965,267,0005,640,0002,113,536