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:18Andrew EpsteinAndrew EpsteinScore: 1,501Success
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:191,48044,416,286102,029,0001,110,0002,166,784
2Oct 31, 2026 03:191,48244,468,897102,168,0001,175,0002,166,784
3Oct 31, 2026 03:191,48644,590,679102,394,0001,205,0002,166,784
4Oct 31, 2026 03:191,48844,641,638102,909,0001,175,0002,166,784
5Oct 31, 2026 03:191,50145,035,377103,904,0001,167,0002,166,784
6Oct 31, 2026 03:191,50745,238,195104,504,0001,153,0002,166,784
7Oct 31, 2026 03:191,50845,250,139104,334,0001,241,0002,166,784
8Oct 31, 2026 03:191,51045,315,193104,857,0001,172,0002,166,784
9Oct 31, 2026 03:191,53846,159,795107,188,0001,186,0002,166,784