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 listJul 23, 2026 17:20boop34boop34Score: 11,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 17:2111,778398,480,828381,961,0006,741,0002,113,536
2Jul 23, 2026 17:2111,783398,624,709382,217,0006,629,0002,113,536
3Jul 23, 2026 17:2111,797399,093,796382,569,0006,744,0002,113,536
4Jul 23, 2026 17:2111,820399,792,813383,267,0006,802,0002,113,536
5Jul 23, 2026 17:2111,859401,274,397384,640,0006,728,0002,113,536
6Jul 23, 2026 17:2111,881401,827,274385,294,0006,779,0002,113,536
7Jul 23, 2026 17:2111,882401,997,599385,322,0006,792,0002,113,536
8Jul 23, 2026 17:2111,890402,180,570385,598,0006,791,0002,113,536
9Jul 23, 2026 17:2111,912403,563,581386,337,0006,788,0002,113,536