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 9, 2026 23:36janwwwjanwwwScore: 38,844Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 23:3838,8411,165,245,569420,516,0002,116,0002,183,168
2Oct 9, 2026 23:3838,8421,165,283,330414,129,0002,214,0002,183,168
3Oct 9, 2026 23:3838,8431,165,318,397419,916,0002,155,0002,183,168
4Oct 9, 2026 23:3838,8431,165,301,579420,144,0002,113,0002,183,168
5Oct 9, 2026 23:3838,8441,165,326,943417,364,0002,155,0002,183,168
6Oct 9, 2026 23:3838,8451,165,357,214421,963,0002,145,0002,183,168
7Oct 9, 2026 23:3838,8451,165,363,018417,577,0002,157,0002,183,168
8Oct 9, 2026 23:3838,8471,165,425,593415,397,0002,176,0002,183,168
9Oct 9, 2026 23:3838,8761,166,294,111418,623,0002,237,0002,146,304