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 2, 2025 10:07tkaltkalScore: 369,184Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2025 10:07366,46712,171,698,75711,770,638,000322,770,0002,330,624
2Jan 2, 2025 10:07367,90912,228,412,10611,830,209,000310,795,0002,351,104
3Jan 2, 2025 10:07368,82212,267,280,33711,860,323,000310,798,0002,396,160
4Jan 2, 2025 10:07368,89912,261,098,35911,852,841,000320,833,0002,482,176
5Jan 2, 2025 10:07369,18412,265,667,72911,864,376,000318,687,0002,396,160
6Jan 2, 2025 10:07369,72312,284,142,63211,866,053,000334,803,0002,478,080
7Jan 2, 2025 10:07370,81612,313,069,03311,909,199,000327,730,0002,322,432
8Jan 2, 2025 10:07373,22512,395,208,81711,998,734,000317,701,0002,510,848
9Jan 2, 2025 10:07373,87012,425,298,34012,022,946,000314,762,0002,490,368