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 22:13Victor MerckléVictor MerckléScore: 2,389Success
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 22:202,36070,808,698182,740,0001,158,0002,162,688stderr
2Aug 17, 2026 22:202,37071,106,581182,286,0001,219,0002,162,688stderr
3Aug 17, 2026 22:202,37871,344,348180,217,0001,212,0002,162,688stderr
4Aug 17, 2026 22:202,37971,397,043181,369,0001,219,0002,162,688stderr
5Aug 17, 2026 22:202,38971,692,749183,080,0002,069,0002,162,688stderr
6Aug 17, 2026 22:202,39871,940,394183,441,0001,221,0002,162,688stderr
7Aug 17, 2026 22:202,72781,818,493194,273,0002,002,0002,158,592stderr
8Aug 17, 2026 22:202,78183,450,182196,540,0001,004,0002,162,688stderr
9Aug 17, 2026 22:202,78683,593,338190,703,0002,035,0002,158,592stderr