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 06:51Andrew EpsteinAndrew EpsteinScore: 1,564Success
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 07:031,53746,135,524100,208,0002,023,0002,183,168stderr
2Oct 31, 2026 07:031,55546,660,759101,864,0002,032,0002,179,072stderr
3Oct 31, 2026 07:031,55746,710,410102,042,0002,010,0002,179,072stderr
4Oct 31, 2026 07:031,56246,867,633102,286,0002,004,0002,224,128stderr
5Oct 31, 2026 07:031,56446,939,252102,841,0002,018,0002,179,072stderr
6Oct 31, 2026 07:031,56747,036,348103,860,0001,011,0002,179,072stderr
7Oct 31, 2026 07:031,56947,076,361104,033,0001,010,0002,183,168stderr
8Oct 31, 2026 07:031,59847,948,401106,820,0001,009,0002,183,168stderr
9Oct 31, 2026 07:031,61048,325,443101,385,0002,027,0002,179,072stderr