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:49Andrew EpsteinAndrew EpsteinScore: 1,511Success
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:501,48944,679,764102,978,0001,142,0002,166,784
2Oct 31, 2026 03:501,49644,899,150103,125,0001,203,0002,166,784
3Oct 31, 2026 03:501,50545,170,836103,573,0001,238,0002,166,784
4Oct 31, 2026 03:501,51045,326,701104,369,0001,145,0002,166,784
5Oct 31, 2026 03:501,51145,351,660104,728,0001,149,0002,158,592
6Oct 31, 2026 03:501,51845,565,563105,884,0001,067,0002,158,592
7Oct 31, 2026 03:501,52945,896,291106,349,0001,254,0002,166,784
8Oct 31, 2026 03:501,54246,278,610107,159,0001,272,0002,166,784
9Oct 31, 2026 03:501,56747,018,933105,553,0001,170,0002,166,784