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 31, 2026 08:39Andrew EpsteinAndrew EpsteinScore: 1,550Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 08:421,52845,852,426100,358,0001,009,0002,179,072stderr
2Oct 31, 2026 08:421,53546,073,624100,044,0002,034,0002,179,072stderr
3Oct 31, 2026 08:421,54746,415,092100,923,0002,025,0002,179,072stderr
4Oct 31, 2026 08:421,55046,512,322101,502,0002,032,0002,183,168stderr
5Oct 31, 2026 08:421,55046,523,166102,638,0001,010,0002,179,072stderr
6Oct 31, 2026 08:421,55746,714,640101,843,0002,026,0002,183,168stderr
7Oct 31, 2026 08:421,56046,822,761102,287,0002,033,0002,179,072stderr
8Oct 31, 2026 08:421,56146,842,502102,417,0002,008,0002,179,072stderr
9Oct 31, 2026 08:421,57447,246,266103,501,0002,033,0002,179,072stderr