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 18, 2025 13:40Rajarshi BasuRajarshi BasuScore: 8,012Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 18, 2025 13:407,898287,118,594252,657,0007,989,0002,527,232
2Dec 18, 2025 13:407,913286,864,169254,131,0007,003,0002,396,160
3Dec 18, 2025 13:407,926292,668,248255,560,0005,989,0002,396,160
4Dec 18, 2025 13:407,970293,650,040256,014,0007,000,0002,416,640
5Dec 18, 2025 13:408,012289,067,762260,405,0004,006,0002,510,848
6Dec 18, 2025 13:408,140296,030,673256,653,00011,983,0002,465,792
7Dec 18, 2025 13:408,262298,804,867267,667,0004,993,0002,269,184
8Dec 18, 2025 13:408,478307,949,572270,796,0008,993,0002,375,680
9Dec 18, 2025 13:408,539313,226,604276,794,0004,996,0002,490,368