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 8, 2026 14:45anboto1anboto1Score: 7,010Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 14:466,997240,582,860221,720,0009,210,0002,117,632
2Jun 8, 2026 14:467,000240,688,826221,813,0009,197,0002,117,632
3Jun 8, 2026 14:467,004240,334,625221,960,0009,177,0002,117,632
4Jun 8, 2026 14:467,005240,758,405221,915,0009,260,0002,117,632
5Jun 8, 2026 14:467,010240,533,644222,092,0009,238,0002,117,632
6Jun 8, 2026 14:467,011241,063,361222,226,0009,145,0002,117,632
7Jun 8, 2026 14:467,072242,599,279224,199,0009,204,0002,117,632
8Jun 8, 2026 14:467,073242,618,928224,109,0009,326,0002,117,632
9Jun 8, 2026 14:467,085243,164,111224,543,0009,272,0002,117,632