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 listAug 17, 2026 12:38Tomislav TunkovicTomislav TunkovicScore: 1,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 12:491,79453,837,238126,413,0002,182,00077,824
2Aug 17, 2026 12:491,79553,874,820126,493,0002,260,00077,824
3Aug 17, 2026 12:491,80154,059,967126,025,0002,178,00073,728
4Aug 17, 2026 12:491,80154,033,160127,123,0002,242,00073,728
5Aug 17, 2026 12:491,80854,255,175124,863,0004,210,00077,824
6Aug 17, 2026 12:491,82454,743,046126,175,0004,020,00073,728
7Aug 17, 2026 12:491,83755,132,273128,234,0003,294,00077,824
8Aug 17, 2026 12:491,84155,253,316125,953,0002,190,00073,728
9Aug 17, 2026 12:491,85355,599,024128,632,0002,244,00073,728