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 16:36anboto1anboto1Score: 32,297Success
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 16:3731,8611,060,874,6541,043,144,0008,271,0002,113,536
2Jun 7, 2026 16:3731,9911,065,545,3811,047,450,0008,253,0002,113,536
3Jun 7, 2026 16:3732,1441,072,176,5261,052,553,0008,206,0002,113,536
4Jun 7, 2026 16:3732,2141,072,426,3481,054,742,0008,334,0002,113,536
5Jun 7, 2026 16:3732,2971,075,201,6551,057,605,0008,215,0002,113,536
6Jun 7, 2026 16:3732,3951,078,402,1241,060,764,0008,285,0002,113,536
7Jun 7, 2026 16:3732,7201,089,375,7401,071,348,0008,425,0002,113,536
8Jun 7, 2026 16:3733,9671,130,746,8491,112,333,0008,605,0002,113,536
9Jun 7, 2026 16:3734,2791,141,110,6421,122,704,0008,534,0002,113,536