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 04:00Andrew EpsteinAndrew EpsteinScore: 1,498Success
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 04:061,47244,180,363100,786,0001,091,0002,166,784
2Oct 31, 2026 04:061,47544,265,433100,998,0001,146,0002,166,784
3Oct 31, 2026 04:061,48544,554,863101,952,0001,240,0002,158,592
4Oct 31, 2026 04:061,48744,633,167101,818,0001,258,0002,166,784
5Oct 31, 2026 04:061,49844,966,957103,074,0001,217,0002,166,784
6Oct 31, 2026 04:061,51145,331,086104,254,0001,285,0002,166,784
7Oct 31, 2026 04:061,51345,390,851104,403,0001,184,0002,166,784
8Oct 31, 2026 04:061,52145,633,404104,923,0001,266,0002,166,784
9Oct 31, 2026 04:061,52845,850,269105,304,0001,235,0002,166,784