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 12:59Victor MerckléVictor MerckléScore: 2,377Success
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 13:022,33870,141,983177,818,0001,230,0002,170,880stderr
2Aug 17, 2026 13:022,36270,864,018179,819,0001,221,0002,170,880stderr
3Aug 17, 2026 13:022,36470,941,914180,574,0001,227,0002,170,880stderr
4Aug 17, 2026 13:022,37671,295,192181,347,0001,243,0002,170,880stderr
5Aug 17, 2026 13:022,37771,328,383181,399,0001,215,0002,170,880stderr
6Aug 17, 2026 13:022,37971,394,829181,394,0001,219,0002,170,880stderr
7Aug 17, 2026 13:022,37971,395,222180,775,0001,209,0002,170,880stderr
8Aug 17, 2026 13:022,38071,401,092181,153,0001,220,0002,170,880stderr
9Aug 17, 2026 13:022,43673,093,316179,833,0001,209,0002,170,880stderr