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 13, 2025 08:21Ian MckibbenIan MckibbenScore: 30,626Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2025 08:2130,5261,031,886,469857,464,000149,906,0002,289,664
2Jan 13, 2025 08:2130,5801,042,237,595873,257,000135,884,0002,318,336
3Jan 13, 2025 08:2130,5951,035,028,015864,676,000144,945,0002,277,376
4Jan 13, 2025 08:2130,5991,039,107,498885,787,000123,970,0002,301,952
5Jan 13, 2025 08:2130,6261,032,791,957878,704,000131,955,0002,334,720
6Jan 13, 2025 08:2130,6371,037,557,876869,146,000141,860,0002,326,528
7Jan 13, 2025 08:2130,6441,039,522,983854,365,000156,883,0002,404,352
8Jan 13, 2025 08:2130,6881,036,257,377872,758,000139,961,0002,289,664
9Jan 13, 2025 08:2130,6911,047,420,421869,832,000142,972,0002,437,120