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 30, 2025 17:48zielajzielajScore: 3,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 17:473,630141,801,884111,802,0007,985,0002,375,680
2Dec 30, 2025 17:483,633143,378,888111,906,0007,993,0002,277,376
3Dec 30, 2025 17:443,637141,349,845113,023,0007,001,0002,281,472
4Dec 30, 2025 17:473,639139,678,350111,093,0009,007,0002,383,872
5Dec 30, 2025 17:443,651146,475,201112,461,0008,032,0002,506,752
6Dec 30, 2025 17:443,656153,280,985113,676,0006,980,0002,539,520
7Dec 30, 2025 17:483,676148,649,094110,291,00011,029,0002,289,664
8Dec 30, 2025 17:483,711147,132,700115,435,0007,026,0002,285,568
9Dec 30, 2025 17:473,735144,752,602113,230,00010,020,0002,293,760