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 20, 2026 22:08Victor MerckléVictor MerckléScore: 6,562Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 22:096,525223,010,079176,751,00038,588,0002,113,536
2Jun 20, 2026 22:096,528223,027,244177,077,00038,355,0002,113,536
3Jun 20, 2026 22:096,552224,258,727177,909,00038,324,0002,113,536
4Jun 20, 2026 22:096,560224,006,893178,014,00038,493,0002,113,536
5Jun 20, 2026 22:096,562223,994,317177,912,00038,659,0002,113,536
6Jun 20, 2026 22:096,610226,036,132180,625,00037,507,0002,113,536
7Jun 20, 2026 22:096,612225,996,592180,729,00037,471,0002,113,536
8Jun 20, 2026 22:096,622226,045,861181,124,00037,431,0002,113,536
9Jun 20, 2026 22:096,647227,262,823181,770,00037,596,0002,113,536