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:56Andrew EpsteinAndrew EpsteinScore: 1,604Success
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 04:011,58647,580,431103,206,0002,033,0002,465,792
2Oct 31, 2026 04:011,59547,852,539104,193,0002,019,0002,203,648
3Oct 31, 2026 04:011,59647,888,081104,785,0002,054,0002,162,688
4Oct 31, 2026 04:011,60348,106,204105,096,0002,051,0002,162,688
5Oct 31, 2026 04:011,60448,145,924103,648,0002,094,0002,441,216
6Oct 31, 2026 04:011,60548,173,665104,944,0002,128,0002,158,592
7Oct 31, 2026 04:011,61348,403,033106,245,0002,063,0002,158,592
8Oct 31, 2026 04:011,61448,442,492105,362,0002,103,0002,461,696
9Oct 31, 2026 04:011,61748,513,219106,381,0002,122,0002,158,592