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 03:12Victor MerckléVictor MerckléScore: 6,611Success
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 03:136,573224,684,703179,597,00037,321,0002,113,536
2Jun 7, 2026 03:136,581224,965,410179,837,00037,364,0002,113,536
3Jun 7, 2026 03:136,588225,183,131179,592,00037,823,0002,113,536
4Jun 7, 2026 03:136,590225,217,595180,103,00037,398,0002,113,536
5Jun 7, 2026 03:136,611225,940,665180,062,00038,120,0002,113,536
6Jun 7, 2026 03:136,618228,510,976181,030,00037,391,0002,113,536
7Jun 7, 2026 03:136,626226,423,459181,223,00037,452,0002,113,536
8Jun 7, 2026 03:136,628226,451,180181,376,00037,376,0002,113,536
9Jun 7, 2026 03:136,660227,485,968182,360,00037,424,0002,113,536