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 7, 2026 19:53highloadLLMhighloadLLMScore: 22,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 19:5422,774760,880,133703,609,00047,940,0002,113,536
2Jun 7, 2026 19:5422,789761,617,310704,362,00047,702,0002,113,536
3Jun 7, 2026 19:5422,794761,891,373704,334,00047,873,0002,113,536
4Jun 7, 2026 19:5422,802762,197,834704,697,00047,772,0002,113,536
5Jun 7, 2026 19:5422,843763,562,414706,126,00047,710,0002,113,536
6Jun 7, 2026 19:5422,859763,929,269706,454,00047,906,0002,113,536
7Jun 7, 2026 19:5422,904765,637,480707,828,00048,031,0002,113,536
8Jun 7, 2026 19:5422,909765,398,464708,540,00047,487,0002,113,536
9Jun 7, 2026 19:5422,927765,906,818708,945,00047,649,0002,113,536