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 listAug 1, 2026 12:05CodeReclaimersCodeReclaimersScore: 99,906Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 12:0799,7903,303,416,5673,256,003,00037,097,0002,113,536
2Aug 1, 2026 12:0799,7923,304,131,1233,256,396,00036,760,0002,113,536
3Aug 1, 2026 12:0799,8293,304,590,0123,258,092,00036,294,0002,113,536
4Aug 1, 2026 12:0799,9003,307,532,2933,259,372,00037,353,0002,113,536
5Aug 1, 2026 12:0799,9063,307,107,0933,259,594,00037,311,0002,113,536
6Aug 1, 2026 12:0799,9113,307,118,1273,259,699,00037,369,0002,113,536
7Aug 1, 2026 12:0799,9813,309,653,2433,261,906,00037,498,0002,113,536
8Aug 1, 2026 12:0799,9913,317,768,3023,261,930,00037,792,0002,113,536
9Aug 1, 2026 12:07100,3643,322,185,1663,274,513,00037,528,0002,113,536