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:28Victor MerckléVictor MerckléScore: 4,851Success
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:294,833167,050,027122,805,00036,704,0002,113,536
2Jun 24, 2026 08:294,841167,239,003122,013,00037,743,0002,113,536
3Jun 24, 2026 08:294,845167,458,325122,137,00037,764,0002,113,536
4Jun 24, 2026 08:294,847167,846,904123,192,00036,791,0002,113,536
5Jun 24, 2026 08:294,851168,226,782122,497,00037,602,0002,113,536
6Jun 24, 2026 08:294,858168,463,589122,607,00037,724,0002,113,536
7Jun 24, 2026 08:294,861168,128,621123,698,00036,740,0002,113,536
8Jun 24, 2026 08:294,874168,417,463122,968,00037,890,0002,113,536
9Jun 24, 2026 08:294,886169,044,128123,278,00037,982,0002,113,536