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 31, 2026 10:28Victor MerckléVictor MerckléScore: 1,680Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 10:281,67150,149,353118,866,0002,030,0002,170,880stderr
2Aug 31, 2026 10:281,67150,151,222119,031,0002,051,0002,170,880stderr
3Aug 31, 2026 10:281,67550,274,527117,821,0001,006,0002,170,880stderr
4Aug 31, 2026 10:281,67750,312,482119,358,0002,014,0002,170,880stderr
5Aug 31, 2026 10:281,68050,400,762118,845,0002,043,0002,170,880stderr
6Aug 31, 2026 10:281,68450,543,819118,473,0001,028,0002,170,880stderr
7Aug 31, 2026 10:281,68450,538,562118,922,0002,013,0002,170,880stderr
8Aug 31, 2026 10:281,68550,576,504120,087,0001,026,0002,170,880stderr
9Aug 31, 2026 10:281,71651,509,242118,861,0001,027,0002,170,880stderr