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 05:55Andrew EpsteinAndrew EpsteinScore: 1,493Success
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 06:011,45743,732,57799,167,0002,992,0002,162,688stderr
2Oct 31, 2026 06:011,48444,530,112101,152,0002,993,0002,162,688stderr
3Oct 31, 2026 06:011,48744,621,289100,618,0003,094,0002,170,880stderr
4Oct 31, 2026 06:011,49044,704,117102,967,0001,258,0002,170,880stderr
5Oct 31, 2026 06:011,49344,813,274103,617,0001,202,0002,170,880stderr
6Oct 31, 2026 06:011,49344,797,271101,909,0001,239,0002,170,880stderr
7Oct 31, 2026 06:011,50045,028,247104,370,0001,011,0002,162,688stderr
8Oct 31, 2026 06:011,50745,224,163105,061,0001,014,0002,162,688stderr
9Oct 31, 2026 06:011,52145,638,661106,084,0001,017,0002,162,688stderr