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 listFeb 16, 2023 19:10LiamLiamError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2023 19:0900000Error: expected "1023936 ", got "1023935 "
2Feb 16, 2023 19:1096,3062,889,184,7882,825,462,16802,412,544
3Feb 16, 2023 19:1096,3952,891,858,8022,834,643,37002,424,832
4Feb 16, 2023 19:1096,4932,894,789,5322,831,695,49302,420,736
5Feb 16, 2023 19:1096,7032,901,088,1572,832,014,40102,420,736
6Feb 16, 2023 19:1097,1852,915,545,8512,835,279,84902,412,544
7Feb 16, 2023 19:1097,6242,928,714,0112,834,639,89802,416,640