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 03:08Victor MerckléVictor MerckléScore: 4,876Success
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 03:084,869168,168,794123,906,00036,798,0002,113,536
2Jun 27, 2026 03:084,873168,981,417124,026,00036,805,0002,113,536
3Jun 27, 2026 03:084,874168,381,529124,204,00036,660,0002,113,536
4Jun 27, 2026 03:084,875168,780,926124,149,00036,738,0002,113,536
5Jun 27, 2026 03:084,876169,071,206124,043,00036,879,0002,113,536
6Jun 27, 2026 03:084,878169,960,659124,152,00036,836,0002,113,536
7Jun 27, 2026 03:084,898169,629,928124,071,00037,581,0002,113,536
8Jun 27, 2026 03:084,904169,728,640125,208,00036,649,0002,113,536
9Jun 27, 2026 03:084,909170,002,113125,046,00036,968,0002,113,536