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:37Andrew EpsteinAndrew EpsteinScore: 1,585Success
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:431,54046,223,420104,495,0001,026,0002,162,688
2Oct 31, 2026 02:431,55146,542,519103,369,0001,006,0002,170,880
3Oct 31, 2026 02:431,55546,676,041102,125,0001,018,0002,170,880
4Oct 31, 2026 02:431,56647,004,027107,338,0001,020,0002,162,688
5Oct 31, 2026 02:431,58547,553,841105,956,0001,005,0002,170,880
6Oct 31, 2026 02:431,58647,591,334106,917,0001,007,0002,170,880
7Oct 31, 2026 02:431,59047,706,341106,495,0001,010,0002,170,880
8Oct 31, 2026 02:431,60548,176,201106,577,0001,007,0002,170,880
9Oct 31, 2026 02:431,61448,428,566106,751,0001,008,0002,170,880