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 03:03Andrew EpsteinAndrew EpsteinScore: 1,695Success
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:141,63649,102,762100,537,0002,081,0002,637,824
2Oct 31, 2026 03:141,66850,068,794103,823,0002,083,0002,641,920
3Oct 31, 2026 03:141,67150,136,729104,336,0001,054,0002,596,864
4Oct 31, 2026 03:141,68650,580,398104,297,0001,051,0002,596,864
5Oct 31, 2026 03:141,69550,861,807105,883,0001,066,0002,592,768
6Oct 31, 2026 03:141,69650,897,981103,964,0002,109,0002,621,440
7Oct 31, 2026 03:141,71951,593,655107,587,0002,094,0002,633,728
8Oct 31, 2026 03:141,72951,880,263103,969,0002,081,0002,637,824
9Oct 31, 2026 03:141,77253,182,872103,524,0002,148,0002,641,920