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 07:04Tomislav TunkovicTomislav TunkovicScore: 2,911Success
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 07:052,84385,290,651215,741,00011,135,0002,162,688
2Aug 15, 2026 07:052,85485,647,484218,533,00010,711,0002,162,688
3Aug 15, 2026 07:052,87886,345,317211,159,00011,604,0002,154,496
4Aug 15, 2026 07:052,91087,302,346216,291,00013,076,0002,162,688
5Aug 15, 2026 07:052,91187,349,500217,367,00010,985,0002,162,688
6Aug 15, 2026 07:052,91187,344,393216,897,00011,100,0002,162,688
7Aug 15, 2026 07:052,91487,426,733216,313,00010,768,0002,162,688
8Aug 15, 2026 07:052,91987,597,989216,941,00012,220,0002,162,688
9Aug 15, 2026 07:053,02690,797,266226,886,00010,745,0002,162,688