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 listJun 24, 2026 04:39Victor MerckléVictor MerckléScore: 3,126Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 04:403,08992,691,144242,982,0002,020,0002,654,208
2Jun 24, 2026 04:403,10593,158,563242,266,0003,163,0002,650,112
3Jun 24, 2026 04:403,10793,238,313242,965,0003,163,0002,408,448
4Jun 24, 2026 04:403,11593,467,512243,440,0003,148,0002,654,208
5Jun 24, 2026 04:403,12693,801,370243,167,0003,170,0002,654,208
6Jun 24, 2026 04:403,12993,882,421244,496,0003,104,0002,654,208
7Jun 24, 2026 04:403,14094,213,258244,430,0003,089,0002,654,208
8Jun 24, 2026 04:403,14094,224,747244,356,0003,086,0002,654,208
9Jun 24, 2026 04:403,14594,377,667244,278,0003,079,0002,654,208