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 06:45Tomislav TunkovicTomislav TunkovicScore: 2,891Success
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 06:462,83184,948,819211,185,00010,849,0002,162,688
2Aug 15, 2026 06:462,84885,448,342215,098,00011,226,0002,162,688
3Aug 15, 2026 06:462,85785,732,683216,617,00010,753,0002,162,688
4Aug 15, 2026 06:462,85985,797,596213,945,00012,134,0002,162,688
5Aug 15, 2026 06:462,89186,749,365219,348,00010,892,0002,162,688
6Aug 15, 2026 06:462,89286,768,656216,499,00011,291,0002,162,688
7Aug 15, 2026 06:462,90187,035,100215,854,00011,689,0002,162,688
8Aug 15, 2026 06:462,90187,039,364218,659,00010,741,0002,162,688
9Aug 15, 2026 06:463,01390,395,808222,126,00011,689,0002,162,688