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 listMar 21, 2026 18:51Dominique GarmierDominique GarmierScore: 8,080Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 18:517,871236,133,550574,547,0009,992,0002,416,640
2Mar 21, 2026 18:517,919237,558,366576,096,00010,001,0002,326,528
3Mar 21, 2026 18:517,964238,907,671571,992,0009,999,0002,408,448
4Mar 21, 2026 18:518,005240,151,430572,546,0008,992,0002,412,544
5Mar 21, 2026 18:518,080242,396,991580,157,0009,985,0002,318,336
6Mar 21, 2026 18:518,185245,535,270597,866,00010,979,0002,416,640
7Mar 21, 2026 18:518,186245,575,052597,172,00010,966,0002,404,352
8Mar 21, 2026 18:518,227246,806,148598,217,0009,970,0002,400,256
9Mar 21, 2026 18:518,286248,568,715602,470,0009,974,0002,383,872