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 09:20Andrew EpsteinAndrew EpsteinScore: 1,467Success
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 09:271,43443,038,51697,299,0001,211,0002,150,400stderr
2Oct 31, 2026 09:271,44343,290,25498,648,0001,111,0002,150,400stderr
3Oct 31, 2026 09:271,44943,493,79799,000,0001,182,0002,154,496stderr
4Oct 31, 2026 09:271,46243,888,58699,999,0001,271,0002,158,592stderr
5Oct 31, 2026 09:271,46744,022,156100,560,0001,196,0002,154,496stderr
6Oct 31, 2026 09:271,47044,123,157100,927,0001,141,0002,154,496stderr
7Oct 31, 2026 09:271,47444,238,048101,326,0001,184,0002,154,496stderr
8Oct 31, 2026 09:271,48844,662,114102,507,0001,194,0002,154,496stderr
9Oct 31, 2026 09:271,51545,464,77498,587,0001,192,0002,158,592stderr