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,691Success
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 03:001,67250,177,747103,447,0002,088,0002,641,920
2Oct 31, 2026 03:001,67750,331,246104,266,0001,077,0002,592,768
3Oct 31, 2026 03:001,68250,472,547104,498,0002,091,0002,621,440
4Oct 31, 2026 03:001,68550,550,592104,859,0002,088,0002,641,920
5Oct 31, 2026 03:001,69150,749,527103,661,0002,069,0002,637,824
6Oct 31, 2026 03:001,69750,912,093105,702,0002,101,0002,641,920
7Oct 31, 2026 03:001,70151,036,740106,323,0001,063,0002,592,768
8Oct 31, 2026 03:001,72551,779,680104,941,0001,061,0002,596,864
9Oct 31, 2026 03:001,72951,888,731105,640,0001,067,0002,596,864