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 9, 2024 15:20Joad 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 9, 2024 15:2000000Error: expected "1024895 ", got "1024894 "stderr
2Jul 9, 2024 15:2000000Error: expected "1023973 ", got "1023972 "stderr
3Jul 9, 2024 15:2000000Error: expected "1025600 ", got "1025599 "stderr
4Jul 9, 2024 15:2000000Error: expected "1024529 ", got "1024526 "stderr
5Jul 9, 2024 15:2100000Error: expected "1018539 ", got "1018536 "stderr
6Jul 9, 2024 15:2100000Error: expected "1020687 ", got "1020685 "stderr
7Jul 9, 2024 15:2100000Error: expected "1022274 ", got "1023424 "stderr
8Jul 9, 2024 15:2100000Error: expected "1024151 ", got "1024148 "stderr
9Jul 9, 2024 15:2100000Error: expected "1022758 ", got "1022762 "stderr
10Jul 9, 2024 15:2100000Error: expected "1022303 ", got "1022302 "stderr
11Jul 9, 2024 15:2100000Error: expected "1021692 ", got "1021691 "stderr