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 15, 2026 19:01Tomislav TunkovicTomislav TunkovicScore: 1,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 19:021,71551,477,435125,578,0001,083,00069,632
2Aug 15, 2026 19:021,72851,866,239126,321,0001,084,00069,632
3Aug 15, 2026 19:021,72951,887,384124,430,0003,019,00069,632
4Aug 15, 2026 19:021,73352,012,849125,154,0002,997,00069,632
5Aug 15, 2026 19:021,73552,079,643125,453,0003,066,00069,632
6Aug 15, 2026 19:021,73752,111,571125,298,0003,103,00069,632
7Aug 15, 2026 19:021,74152,249,066126,931,0001,992,00069,632
8Aug 15, 2026 19:021,74152,237,443125,613,0002,997,00069,632
9Aug 15, 2026 19:021,76753,011,578125,422,0003,043,00069,632