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 23:46Tomislav TunkovicTomislav TunkovicScore: 2,935Success
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 23:472,85685,689,872214,412,00011,507,0002,162,688
2Aug 14, 2026 23:472,86285,875,894215,308,00011,239,0002,162,688
3Aug 14, 2026 23:472,89586,868,796218,638,00011,264,0002,162,688
4Aug 14, 2026 23:472,90187,049,282218,889,00011,194,0002,162,688
5Aug 14, 2026 23:472,93588,072,640221,066,00011,672,0002,162,688
6Aug 14, 2026 23:472,94788,415,125220,038,00011,689,0002,162,688
7Aug 14, 2026 23:472,95688,702,674223,457,00011,113,0002,162,688
8Aug 14, 2026 23:472,96989,072,450222,734,00011,519,0002,162,688
9Aug 14, 2026 23:472,99489,835,847222,569,00011,310,0002,162,688