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 09:49anboto1anboto1Score: 5,524Success
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 09:505,496190,566,910172,089,0009,284,0002,117,632
2Jun 8, 2026 09:505,499191,119,447172,257,0009,218,0002,117,632
3Jun 8, 2026 09:505,502191,096,821172,335,0009,246,0002,117,632
4Jun 8, 2026 09:505,512191,625,087173,653,0008,252,0002,117,632
5Jun 8, 2026 09:505,524191,975,745173,097,0009,201,0002,117,632
6Jun 8, 2026 09:505,534191,891,752173,360,0009,271,0002,117,632
7Jun 8, 2026 09:505,545192,254,963173,789,0009,203,0002,117,632
8Jun 8, 2026 09:505,585193,568,633174,996,0009,315,0002,117,632
9Jun 8, 2026 09:505,601194,113,816175,532,0009,331,0002,117,632