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 listOct 30, 2025 08:53Alexander-PopovAlexander-PopovScore: 280,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 30, 2025 08:53278,0399,210,745,5039,028,394,000146,908,0002,416,640
2Oct 30, 2025 08:53278,8559,244,153,5119,080,313,000121,910,0002,334,720
3Oct 30, 2025 08:53279,0359,237,418,8839,044,266,000163,896,0002,265,088
4Oct 30, 2025 08:53280,8259,298,872,6129,097,331,000169,894,0002,396,160
5Oct 30, 2025 08:53280,9549,298,870,9859,139,584,000131,907,0002,301,952
6Oct 30, 2025 08:53281,4039,317,416,8899,119,412,000166,897,0002,375,680
7Oct 30, 2025 08:53281,6049,324,286,4619,158,032,000134,897,0002,289,664
8Oct 30, 2025 08:53281,7009,328,874,5759,157,183,000138,911,0002,277,376
9Oct 30, 2025 08:53282,5949,360,877,2429,183,711,000141,902,0002,412,544