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 13, 2024 01:35Joad 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 13, 2024 01:3500000Error: expected "1024437 ", got "1024436 "stderr
2Jul 13, 2024 01:3600000Error: expected "1025129 ", got "1025127 "stderr
3Jul 14, 2024 12:4800000Error: expected "1021546 ", got "1021544 "stderr
4Jul 13, 2024 01:393,320167,525,568109,545,02602,232,320
5Jul 13, 2024 01:393,321167,372,149109,601,05602,224,128
6Jul 13, 2024 01:393,327175,667,557109,792,42302,224,128