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 listJan 11, 2025 01:23Ian MckibbenIan MckibbenScore: 30,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2025 01:2330,4851,037,201,917849,000,000157,000,0002,338,816
2Jan 11, 2025 01:2330,5651,036,041,694879,682,000128,953,0002,367,488
3Jan 11, 2025 01:2330,5761,036,765,472861,153,000147,854,0002,506,752
4Jan 11, 2025 01:2330,5871,034,735,449859,453,000149,904,0002,330,624
5Jan 11, 2025 01:2330,6161,031,396,301871,421,000138,907,0002,486,272
6Jan 11, 2025 01:2330,6221,035,131,602872,598,000137,936,0002,326,528
7Jan 11, 2025 01:2330,6811,039,650,291867,545,000144,924,0002,494,464
8Jan 11, 2025 01:2330,7031,036,525,299875,295,000137,889,0002,326,528
9Jan 11, 2025 01:2330,7781,048,808,833858,732,000156,951,0002,342,912