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 27, 2026 08:17Victor MerckléVictor MerckléScore: 6,555Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 08:186,548223,924,983179,535,00036,572,0002,113,536
2Jun 27, 2026 08:186,552223,856,772179,432,00036,785,0002,113,536
3Jun 27, 2026 08:186,554224,361,025179,471,00036,820,0002,113,536
4Jun 27, 2026 08:186,554224,342,621179,442,00036,869,0002,113,536
5Jun 27, 2026 08:186,555224,420,983179,521,00036,810,0002,113,536
6Jun 27, 2026 08:186,560231,927,800179,470,00037,037,0002,117,632
7Jun 27, 2026 08:186,560224,663,779179,752,00036,745,0002,113,536
8Jun 27, 2026 08:186,563224,222,975179,756,00036,850,0002,113,536
9Jun 27, 2026 08:186,570224,292,023179,102,00037,711,0002,113,536