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 listDec 23, 2025 18:09zielajzielajScore: 4,058Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 18:094,053156,819,886123,760,0009,980,0002,387,968
2Dec 23, 2025 18:094,055154,955,579120,822,00012,980,0002,461,696
3Dec 23, 2025 18:094,056156,101,733128,854,0004,994,0002,371,584
4Dec 23, 2025 18:094,058153,257,943124,925,0008,994,0002,449,408
5Dec 23, 2025 18:094,058155,806,261123,927,0009,994,0002,396,160
6Dec 23, 2025 18:094,058161,631,529122,931,00010,993,0002,441,216
7Dec 23, 2025 18:094,065155,683,901121,126,00013,013,0002,400,256
8Dec 23, 2025 18:094,066154,101,724123,166,00011,014,0002,359,296
9Dec 23, 2025 18:094,082164,005,916125,740,0008,981,0002,424,832