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 listJul 12, 2024 00:05Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2024 00:0600000Error: No answer to stdout. Died or killed?stderr
2Jul 12, 2024 00:063,971200,258,261131,029,36602,306,048
3Jul 12, 2024 00:053,977192,351,860131,250,49602,183,168
4Jul 12, 2024 00:053,980200,419,176131,341,84002,183,168
5Jul 12, 2024 00:054,026203,935,485132,857,60802,306,048
6Jul 12, 2024 00:064,029197,992,138132,946,40202,187,264
7Jul 12, 2024 00:064,674217,496,697154,232,29202,187,264