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 09:11Andrew EpsteinAndrew EpsteinScore: 1,478Success
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 09:181,46243,862,00799,578,0001,242,0002,170,880stderr
2Oct 31, 2026 09:181,46744,036,691100,344,0001,199,0002,170,880stderr
3Oct 31, 2026 09:181,46744,026,959100,087,0001,195,0002,170,880stderr
4Oct 31, 2026 09:181,47444,248,868100,968,0001,155,0002,170,880stderr
5Oct 31, 2026 09:181,47844,354,832101,694,0001,111,0002,170,880stderr
6Oct 31, 2026 09:181,48044,405,083101,312,0001,199,0002,170,880stderr
7Oct 31, 2026 09:181,48544,572,633101,703,0001,113,0002,170,880stderr
8Oct 31, 2026 09:181,48844,648,303101,342,0001,220,0002,170,880stderr
9Oct 31, 2026 09:181,52345,693,016105,511,0001,174,0002,162,688stderr