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 listOct 3, 2024 22:12Joad NacerJoad NacerScore: 4,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2024 22:114,736176,135,122152,270,0004,007,0002,527,232
2Oct 3, 2024 22:124,768182,602,140152,346,0005,011,0002,527,232
3Oct 3, 2024 22:124,801188,134,410154,420,0004,010,0002,285,568
4Oct 3, 2024 22:114,805184,031,802156,573,0001,994,0002,269,184
5Oct 3, 2024 22:124,806182,291,719154,609,0003,989,0002,453,504
6Oct 3, 2024 22:124,848181,624,359154,980,0004,999,0002,457,600
7Oct 3, 2024 22:114,860187,108,604157,387,0003,007,0002,527,232
8Oct 3, 2024 22:124,874189,527,665158,837,0001,997,0002,269,184
9Oct 3, 2024 22:124,926188,619,631159,567,0002,991,0002,359,296