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 listMar 23, 2025 15:35Aniruddha DebAniruddha DebScore: 23,033Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2025 15:3522,835772,035,299729,577,00023,986,0002,338,816
2Mar 23, 2025 15:3522,864784,323,976731,535,00022,985,0002,469,888
3Mar 23, 2025 15:3522,984781,853,926734,505,00023,983,0002,519,040
4Mar 23, 2025 15:3522,997778,645,057735,919,00022,997,0002,371,584
5Mar 23, 2025 15:3523,033789,976,386745,094,00014,981,0002,416,640
6Mar 23, 2025 15:3523,098786,475,416742,252,00019,979,0002,347,008
7Mar 23, 2025 15:3523,156789,332,100742,188,00021,975,0002,359,296
8Mar 23, 2025 15:3523,214794,646,887749,093,00016,979,0002,527,232
9Mar 23, 2025 15:3523,257790,677,665738,503,00028,980,0002,527,232