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 listOct 31, 2026 02:27Andrew EpsteinAndrew EpsteinScore: 1,653Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 02:321,63248,982,636102,400,0002,170,0002,162,688
2Oct 31, 2026 02:321,64349,312,135101,406,0002,164,0002,162,688
3Oct 31, 2026 02:321,64549,350,118103,783,0001,012,0002,174,976
4Oct 31, 2026 02:321,64649,407,234102,430,0002,070,0002,162,688
5Oct 31, 2026 02:321,65349,603,485104,020,0001,093,0002,174,976
6Oct 31, 2026 02:321,68550,560,010103,738,0002,080,0002,174,976
7Oct 31, 2026 02:321,68650,588,246102,704,0002,024,0002,174,976
8Oct 31, 2026 02:321,72051,614,975108,071,0001,021,0002,174,976
9Oct 31, 2026 02:321,72551,774,843104,162,0002,005,0002,174,976