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 23, 2026 14:48Victor MerckléVictor MerckléScore: 2,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 14:502,52175,648,894196,890,0001,229,0002,170,880stderr
2Aug 23, 2026 14:502,52575,754,379196,907,0001,229,0002,170,880stderr
3Aug 23, 2026 14:502,54376,303,030198,437,0001,217,0002,170,880stderr
4Aug 23, 2026 14:502,54576,371,410198,451,0001,136,0002,170,880stderr
5Aug 23, 2026 14:502,57677,282,930197,788,0001,258,0002,170,880stderr
6Aug 23, 2026 14:502,58477,534,463201,478,0001,009,0002,170,880stderr
7Aug 23, 2026 14:502,62478,736,501204,206,0001,204,0002,170,880stderr
8Aug 23, 2026 14:502,63178,942,178201,303,0001,247,0002,170,880stderr
9Aug 23, 2026 14:502,69180,743,813209,373,0001,239,0002,170,880stderr