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 15, 2024 21:26Joad 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 15, 2024 21:2600000Error: expected "1023806 ", got "1023799 "stderr
2Jul 15, 2024 21:2600000Error: expected "1019874 ", got "1019867 "stderr
3Jul 15, 2024 21:2600000Error: expected "1018628 ", got "1018624 "stderr
4Jul 15, 2024 21:2600000Error: expected "1022120 ", got "1022113 "stderr
5Jul 15, 2024 21:2600000Error: expected "1023504 ", got "1023499 "stderr
6Jul 15, 2024 21:2600000Error: expected "1024676 ", got "1024669 "stderr
7Jul 15, 2024 21:2600000Error: expected "1025118 ", got "1025114 "stderr
8Jul 15, 2024 21:2600000Error: expected "1026118 ", got "1026112 "stderr
9Jul 15, 2024 21:2600000Error: expected "1019691 ", got "1019685 "stderr
10Jul 15, 2024 21:2600000Error: expected "1026256 ", got "1026252 "stderr
11Jul 15, 2024 21:2600000Error: expected "1019672 ", got "1019664 "stderr