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 24, 2024 21:20Andrey LikhachevAndrey LikhachevError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2024 21:2000000Error: expected "1025119 ", got "1025120 "stderr
2Jul 24, 2024 21:2200000Error: expected "1022615 ", got "1022616 "stderr
3Jul 24, 2024 21:2200000Error: expected "1025162 ", got "1025161 "stderr
4Jul 24, 2024 21:2300000Error: expected "1023336 ", got "1023335 "stderr
5Jul 24, 2024 21:2300000Error: expected "1020673 ", got "1020672 "stderr
6Jul 24, 2024 21:2300000Error: expected "1019982 ", got "1019983 "stderr
7Jul 24, 2024 21:2400000Error: expected "1023612 ", got "1023613 "stderr
8Jul 24, 2024 21:2500000Error: expected "1025184 ", got "1025185 "stderr
9Jul 24, 2024 21:2500000Error: expected "1023735 ", got "1023736 "stderr
10Jul 24, 2024 21:2500000Error: expected "1021714 ", got "1021713 "stderr
11Jul 24, 2024 21:2600000Error: expected "1021798 ", got "1021797 "stderr