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 listJun 16, 2024 15:00Joad 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
1Jun 16, 2024 15:0000000Error: expected "1023021 ", got "1011683 "stderr
2Jun 16, 2024 15:0500000Error: expected "1025060 ", got "1013625 "stderr
3Jun 16, 2024 15:0500000Error: expected "1018369 ", got "1007170 "stderr
4Jun 16, 2024 15:0500000Error: expected "1023665 ", got "1012279 "stderr
5Jun 16, 2024 15:0500000Error: expected "1023050 ", got "1011620 "stderr
6Jun 16, 2024 15:0500000Error: expected "1024731 ", got "1013223 "stderr
7Jun 16, 2024 15:0500000Error: expected "1019669 ", got "1008472 "stderr
8Jun 16, 2024 15:0500000Error: expected "1022250 ", got "1010809 "stderr
9Jun 16, 2024 15:0500000Error: expected "1021881 ", got "1010610 "stderr
10Jun 16, 2024 15:0500000Error: expected "1020599 ", got "1009384 "stderr