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:53Yuriy 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:5400000Error: expected "1037647 ", got "1037646 "
2Jun 7, 2021 17:5400000Error: expected "1037835 ", got "1037833 "
3Jun 7, 2021 18:0900000Error: expected "1035953 ", got "1035952 "
4Jun 7, 2021 17:537,591227,742,008511,329,81202,347,008
5Jun 7, 2021 17:537,771233,142,769513,436,86902,461,696
6Jun 7, 2021 17:538,013240,400,980511,033,07102,596,864