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 02:47Andrew EpsteinAndrew EpsteinScore: 1,575Success
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 02:521,56647,007,757101,808,0003,180,0002,174,976
2Oct 31, 2026 02:521,56646,983,757101,515,0003,124,0002,162,688
3Oct 31, 2026 02:521,57047,122,495101,942,0003,087,0002,162,688
4Oct 31, 2026 02:521,57247,170,826101,899,0003,276,0002,174,976
5Oct 31, 2026 02:521,57547,267,731102,840,0003,067,0002,162,688
6Oct 31, 2026 02:521,58447,542,002103,045,0003,106,0002,174,976
7Oct 31, 2026 02:521,58547,579,474103,146,0003,117,0002,174,976
8Oct 31, 2026 02:521,59847,955,274104,488,0003,106,0002,162,688
9Oct 31, 2026 02:521,60948,281,785105,563,0003,112,0002,162,688