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 8, 2021 22:36Yuriy 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 8, 2021 22:3600000Error: expected "1040113 ", got "1040112 "
2Jun 8, 2021 22:3600000Error: expected "1035600 ", got "1035599 "
3Jun 8, 2021 22:3600000Error: expected "1038150 ", got "1038149 "
4Jun 8, 2021 22:368,586257,593,076579,900,18402,523,136
5Jun 8, 2021 22:368,614258,417,764578,752,70002,654,208
6Jun 8, 2021 22:369,748292,429,704577,866,77202,625,536