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 18, 2026 15:27Victor MerckléVictor MerckléScore: 2,009Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 15:281,94958,492,897142,732,0001,007,0002,170,880stderr
2Aug 18, 2026 15:281,96258,869,404144,748,0001,026,0002,170,880stderr
3Aug 18, 2026 15:281,96258,871,630142,233,0001,009,0002,170,880stderr
4Aug 18, 2026 15:282,00760,221,459146,122,0001,027,0002,170,880stderr
5Aug 18, 2026 15:282,00960,272,563148,859,0001,299,0002,170,880stderr
6Aug 18, 2026 15:282,01160,349,913146,677,0001,030,0002,170,880stderr
7Aug 18, 2026 15:282,01660,503,773147,021,0002,044,0002,170,880stderr
8Aug 18, 2026 15:282,02560,759,204148,593,0001,033,0002,170,880stderr
9Aug 18, 2026 15:282,04561,365,211150,405,0002,043,0002,170,880stderr