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 13:03Victor MerckléVictor MerckléError
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 13:04052,967,281124,921,0002,024,0002,170,880expected "1022817 ", got "1022816 "stderr
2Aug 31, 2026 13:041,71051,321,444122,133,0002,032,0002,170,880stderr
3Aug 31, 2026 13:041,71751,530,316121,750,0001,014,0002,170,880stderr
4Aug 31, 2026 13:041,72051,603,980122,551,0001,033,0002,170,880stderr
5Aug 31, 2026 13:041,72651,786,914122,367,0001,020,0002,170,880stderr
6Aug 31, 2026 13:041,77553,256,304124,367,0001,027,0002,170,880stderr
7Aug 31, 2026 13:041,78953,681,531129,085,0002,003,0002,170,880stderr
8Aug 31, 2026 13:041,81854,565,906128,672,0001,030,0002,170,880stderr
9Aug 31, 2026 13:041,82154,644,392128,700,0001,017,0002,170,880stderr