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 22, 2025 05:57Ian MckibbenIan MckibbenScore: 17,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 05:5717,785611,994,683497,913,00088,984,0002,437,120
2Jun 22, 2025 05:5717,810605,401,934500,774,00086,960,0002,375,680
3Jun 22, 2025 05:5717,850617,646,364509,036,00080,005,0002,527,232
4Jun 22, 2025 05:5717,851615,215,163498,059,00091,010,0002,498,560
5Jun 22, 2025 05:5717,860611,905,040503,482,00085,911,0002,437,120
6Jun 22, 2025 05:5717,892613,353,814503,525,00086,918,0002,277,376
7Jun 22, 2025 05:5717,907619,874,862510,937,00079,990,0002,281,472
8Jun 22, 2025 05:5717,964616,295,434505,840,00086,972,0002,281,472
9Jun 22, 2025 05:5718,181631,856,608522,114,00077,867,0002,338,816