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 listSep 5, 2026 00:38Victor MerckléVictor MerckléScore: 1,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 00:541,71751,539,659121,870,0001,037,0002,170,880stderr
2Sep 5, 2026 00:541,71951,579,382122,630,0002,020,0002,170,880stderr
3Sep 5, 2026 00:541,72851,852,114121,295,0002,013,0002,170,880stderr
4Sep 5, 2026 00:541,73151,930,985121,554,0002,027,0002,170,880stderr
5Sep 5, 2026 00:541,73752,127,569122,697,0001,028,0002,170,880stderr
6Sep 5, 2026 00:541,73952,195,699121,976,0002,045,0002,170,880stderr
7Sep 5, 2026 00:541,75052,522,577122,458,0001,019,0002,170,880stderr
8Sep 5, 2026 00:541,76252,882,470121,934,0001,043,0002,170,880stderr
9Sep 5, 2026 00:541,76352,897,832122,780,0001,040,0002,170,880stderr