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 19, 2025 00:37Ian MckibbenIan MckibbenScore: 27,296Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 00:3727,203925,842,563814,717,00082,971,0002,465,792
2Jan 19, 2025 00:3727,212922,831,617808,097,00089,899,0002,437,120
3Jan 19, 2025 00:3727,234922,961,601826,749,00071,978,0002,273,280
4Jan 19, 2025 00:3727,247922,594,404814,236,00084,920,0002,457,600
5Jan 19, 2025 00:3727,296930,578,900812,793,00087,977,0002,285,568
6Jan 19, 2025 00:3727,323920,661,585824,788,00076,887,0002,392,064
7Jan 19, 2025 00:3727,344931,854,879813,417,00088,936,0002,437,120
8Jan 19, 2025 00:3727,399924,794,071826,241,00077,928,0002,502,656
9Jan 19, 2025 00:3727,404925,560,969815,390,00088,933,0002,301,952