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:02Andrew EpsteinAndrew EpsteinScore: 1,588Success
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:061,54346,291,67499,824,0003,155,0002,174,976
2Oct 31, 2026 03:061,54646,389,59399,946,0003,102,0002,162,688
3Oct 31, 2026 03:061,54646,388,91699,896,0003,105,0002,162,688
4Oct 31, 2026 03:061,56346,916,778101,524,0003,096,0002,162,688
5Oct 31, 2026 03:061,58847,662,501103,496,0003,212,0002,162,688
6Oct 31, 2026 03:061,59447,824,952103,859,0003,184,0002,174,976
7Oct 31, 2026 03:061,59547,852,354104,637,0003,146,0002,162,688
8Oct 31, 2026 03:061,61648,484,594106,342,0003,112,0002,174,976
9Oct 31, 2026 03:061,64149,244,718103,738,0003,165,0002,174,976