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 04:03Andrew EpsteinAndrew EpsteinScore: 1,608Success
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:141,58147,438,009102,512,0002,142,0002,158,592
2Oct 31, 2026 04:141,58747,636,877102,985,0002,098,0002,424,832
3Oct 31, 2026 04:141,59347,807,849104,513,0001,064,0002,416,640
4Oct 31, 2026 04:141,60848,258,476103,892,0002,032,0002,207,744
5Oct 31, 2026 04:141,65249,572,055103,993,0002,048,0002,158,592
6Oct 31, 2026 04:142,18365,491,550127,106,0002,015,0002,158,592