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 19:20Павел РатмановПавел РатмановScore: 95,655Success
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 19:2094,6463,149,395,9932,989,470,000133,841,0002,277,376
2Dec 30, 2025 19:2095,3123,172,656,8743,014,463,000130,846,0002,277,376
3Dec 30, 2025 19:2095,3583,175,189,8852,999,996,000146,804,0002,277,376
4Dec 30, 2025 19:2095,4783,178,650,8323,002,935,000147,849,0002,367,488
5Dec 30, 2025 19:2095,6553,180,998,9863,017,776,000138,851,0002,347,008
6Dec 30, 2025 19:2095,8683,203,081,2153,043,780,000119,873,0002,486,272
7Dec 30, 2025 19:2095,9463,193,013,5223,042,354,000123,851,0002,277,376
8Dec 30, 2025 19:2096,0813,195,710,3563,030,818,000139,853,0002,277,376
9Dec 30, 2025 19:2096,3183,212,566,2403,050,628,000127,858,0002,363,392