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 16:39anboto1anboto1Score: 37,989Success
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 16:4036,7561,222,425,1661,206,085,0006,884,0002,113,536
2Jun 7, 2026 16:4036,8361,225,046,8801,208,815,0006,779,0002,113,536
3Jun 7, 2026 16:4037,1661,235,819,2991,219,690,0006,808,0002,113,536
4Jun 7, 2026 16:4037,8161,258,267,4361,241,127,0006,818,0002,113,536
5Jun 7, 2026 16:4037,9891,263,434,0501,246,864,0006,777,0002,113,536
6Jun 7, 2026 16:4038,5511,281,628,3031,265,073,0007,141,0002,113,536
7Jun 7, 2026 16:4038,7801,289,789,4981,272,847,0006,906,0002,113,536
8Jun 7, 2026 16:4040,3141,351,627,4351,323,428,0006,949,0002,113,536
9Jun 7, 2026 16:4040,3371,350,736,1121,324,351,0006,786,0002,113,536