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 03:24Andrew EpsteinAndrew EpsteinScore: 1,609Success
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 03:271,58047,417,311102,708,0002,110,0002,162,688
2Oct 31, 2026 03:271,58847,648,425103,581,0002,133,0002,158,592
3Oct 31, 2026 03:271,60448,140,174104,764,0002,116,0002,158,592
4Oct 31, 2026 03:271,60548,167,984105,326,0002,061,0002,158,592
5Oct 31, 2026 03:271,60948,296,288105,280,0002,139,0002,158,592
6Oct 31, 2026 03:271,61748,523,174107,055,0001,060,0002,416,640
7Oct 31, 2026 03:271,63148,957,982108,499,0001,063,0002,420,736
8Oct 31, 2026 03:271,63549,061,727107,347,0002,149,0002,158,592
9Oct 31, 2026 03:271,65149,536,144109,213,0002,083,0002,424,832