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:39Tomislav TunkovicTomislav TunkovicScore: 2,904Success
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:402,85185,541,225211,587,00011,172,0002,158,592
2Aug 15, 2026 06:402,85485,629,654214,813,00011,257,0002,162,688
3Aug 15, 2026 06:402,87586,278,194215,624,00010,689,0002,162,688
4Aug 15, 2026 06:402,89286,763,340216,930,00011,763,0002,162,688
5Aug 15, 2026 06:402,90487,145,999220,657,00011,712,0002,162,688
6Aug 15, 2026 06:402,90587,168,923216,097,00011,215,0002,162,688
7Aug 15, 2026 06:402,91687,488,784216,268,00011,857,0002,158,592
8Aug 15, 2026 06:402,91987,585,003219,070,00011,229,0002,162,688
9Aug 15, 2026 06:402,94188,243,932219,155,00011,783,0002,162,688