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:48Andrew EpsteinAndrew EpsteinScore: 1,513Success
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:571,48944,678,821103,091,0001,237,0002,162,688
2Oct 31, 2026 02:571,49244,789,084103,371,0001,010,0002,162,688
3Oct 31, 2026 02:571,49644,895,899103,452,0001,013,0002,170,880
4Oct 31, 2026 02:571,51345,403,095105,367,0001,012,0002,162,688
5Oct 31, 2026 02:571,51345,391,489104,908,0001,014,0002,170,880
6Oct 31, 2026 02:571,51645,485,914105,218,0001,013,0002,170,880
7Oct 31, 2026 02:571,51945,584,899105,538,0001,018,0002,170,880
8Oct 31, 2026 02:571,53045,922,819106,730,0001,209,0002,170,880
9Oct 31, 2026 02:571,54146,249,804106,821,0002,020,0002,170,880