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 listMar 16, 2026 13:51Dominique GarmierDominique GarmierScore: 12,486Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 13:5112,258367,747,702980,972,00013,985,0003,063,808
2Mar 16, 2026 13:5112,319369,569,445982,986,0008,990,0002,564,096
3Mar 16, 2026 13:5112,354370,613,496979,636,0008,987,0002,555,904
4Mar 16, 2026 13:5112,373371,180,293985,842,00010,998,0002,732,032
5Mar 16, 2026 13:5112,486374,579,834996,402,0008,985,0002,568,192
6Mar 16, 2026 13:5112,513375,402,553998,373,00010,982,0002,813,952
7Mar 16, 2026 13:5112,665379,938,836999,352,0008,994,0002,752,512
8Mar 16, 2026 13:5112,689380,661,5161,007,874,0008,989,0002,289,664
9Mar 16, 2026 13:5112,800383,986,9671,003,135,0006,993,0002,789,376