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 09:19Andrew EpsteinAndrew EpsteinScore: 1,471Success
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 09:261,43843,141,93997,985,0001,195,0002,170,880stderr
2Oct 31, 2026 09:261,45143,544,34299,121,0001,143,0002,154,496stderr
3Oct 31, 2026 09:261,45443,633,70899,593,0001,130,0002,162,688stderr
4Oct 31, 2026 09:261,45843,755,70299,842,0001,167,0002,154,496stderr
5Oct 31, 2026 09:261,47144,147,143101,094,0001,200,0002,158,592stderr
6Oct 31, 2026 09:261,47244,174,621100,065,0002,029,0002,154,496stderr
7Oct 31, 2026 09:261,47244,179,815100,947,0001,102,0002,150,400stderr
8Oct 31, 2026 09:261,47244,185,563101,049,0001,215,0002,170,880stderr
9Oct 31, 2026 09:261,47544,260,397101,514,0001,014,0002,150,400stderr