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 14, 2026 22:57Tomislav TunkovicTomislav TunkovicScore: 2,968Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 22:582,92087,605,536222,444,0007,503,0002,162,688
2Aug 14, 2026 22:582,93287,969,123226,401,0007,540,0002,162,688
3Aug 14, 2026 22:582,93788,111,574224,043,0007,397,0002,162,688
4Aug 14, 2026 22:582,95188,539,484224,352,0007,530,0002,162,688
5Aug 14, 2026 22:582,96889,065,528228,842,0006,972,0002,162,688
6Aug 14, 2026 22:583,00190,033,927229,328,0007,925,0002,158,592
7Aug 14, 2026 22:583,00290,083,986222,028,0007,539,0002,150,400
8Aug 14, 2026 22:583,00890,263,136227,735,0007,420,0002,162,688
9Aug 14, 2026 22:583,02490,721,368225,431,0007,581,0002,154,496