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 listOct 1, 2023 14:22apuxbtapuxbtScore: 22,111Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2023 13:0321,883656,481,971588,938,29002,367,488
2Oct 1, 2023 13:0321,901657,021,673589,657,11802,240,512
3Oct 1, 2023 14:2221,979659,373,294588,539,81502,355,200
4Oct 1, 2023 14:2222,017660,509,327591,029,90502,342,912
5Oct 1, 2023 13:0322,111663,343,408588,607,48602,355,200
6Oct 1, 2023 14:2222,347670,415,496597,103,08202,367,488
7Oct 1, 2023 14:2222,354670,612,760605,889,25402,359,296
8Oct 1, 2023 14:2222,671680,119,010604,337,28802,359,296
9Oct 1, 2023 14:2222,900686,988,671596,480,33702,240,512