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 21:59Yuriy 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 21:5900000Error: expected "1035473 ", got "1035472 "
2Jun 7, 2021 22:0000000Error: expected "1039777 ", got "1039781 "
3Jun 7, 2021 22:0000000Error: expected "1036536 ", got "1036538 "
4Jun 7, 2021 22:0000000Error: expected "1039473 ", got "1039474 "
5Jun 7, 2021 22:0000000Error: expected "1033985 ", got "1033987 "