Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 7, 2021 17:49Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2021 17:4900000Error: expected "1040287 ", got "1040076 "
2Jun 7, 2021 17:5000000Error: expected "1036892 ", got "1036890 "
3Jun 7, 2021 17:5100000Error: expected "1037988 ", got "1037987 "
4Jun 7, 2021 17:5100000Error: expected "1035308 ", got "1035307 "
5Jun 7, 2021 17:5100000Error: expected "1034280 ", got "1034279 "
6Jun 7, 2021 17:5600000Error: expected "1037408 ", got "1037259 "