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 24, 2026 08:12Victor MerckléVictor MerckléScore: 4,934Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 08:134,908169,764,838125,126,00036,863,0002,113,536
2Jun 24, 2026 08:134,913169,821,085125,458,00036,679,0002,113,536
3Jun 24, 2026 08:134,916170,059,901125,416,00036,832,0002,113,536
4Jun 24, 2026 08:134,932170,681,259126,004,00036,764,0002,113,536
5Jun 24, 2026 08:134,934171,067,442125,242,00037,598,0002,113,536
6Jun 24, 2026 08:134,941171,228,029125,384,00037,697,0002,113,536
7Jun 24, 2026 08:134,945170,908,555125,615,00037,594,0002,113,536
8Jun 24, 2026 08:134,955171,848,881125,762,00037,753,0002,113,536
9Jun 24, 2026 08:134,959171,658,093125,851,00037,798,0002,113,536