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 17, 2024 14:30Joad 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 17, 2024 14:3000000Error: expected "1018865 ", got "1018863 "stderr
2Jul 17, 2024 17:0600000Error: expected "1021691 ", got "1021688 "stderr
3Jul 17, 2024 17:0900000Error: expected "1026650 ", got "1026648 "stderr
4Jul 17, 2024 17:123,465180,224,197114,356,57202,232,320
5Jul 17, 2024 17:123,467175,515,935114,400,39002,224,128
6Jul 17, 2024 17:123,502188,492,127115,551,23902,224,128