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 8, 2024 23:14Joad 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 8, 2024 23:1400000Error: expected "1019922 ", got "1019919 "stderr
2Jul 8, 2024 23:1500000Error: expected "1023766 ", got "1023763 "stderr
3Jul 8, 2024 23:1500000Error: expected "1020651 ", got "1020647 "stderr
4Jul 8, 2024 23:1500000Error: expected "1023814 ", got "1023812 "stderr
5Jul 8, 2024 23:1500000Error: expected "1021549 ", got "1021548 "stderr
6Jul 8, 2024 23:1500000Error: expected "1024885 ", got "1024884 "stderr
7Jul 8, 2024 23:1500000Error: expected "1018722 ", got "1018721 "stderr
8Jul 8, 2024 23:1500000Error: expected "1023607 ", got "1023605 "stderr
9Jul 8, 2024 23:1500000Error: expected "1018892 ", got "1018891 "stderr
10Jul 8, 2024 23:1500000Error: expected "1019614 ", got "1019613 "stderr
11Jul 8, 2024 23:1500000Error: expected "1021424 ", got "1021422 "stderr