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 9, 2026 07:26Karthik ReddyKarthik ReddyScore: 1,465Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 07:271,45443,630,763101,773,0001,094,000319,488
2Oct 9, 2026 07:271,45743,719,245101,980,0001,115,000319,488
3Oct 9, 2026 07:271,45843,759,792101,617,0001,119,000319,488
4Oct 9, 2026 07:271,46143,831,925101,834,0001,114,000319,488
5Oct 9, 2026 07:271,46543,958,789102,798,0001,025,000319,488
6Oct 9, 2026 07:271,47044,101,970102,869,0001,118,000319,488
7Oct 9, 2026 07:271,47344,195,342103,123,0001,012,000319,488
8Oct 9, 2026 07:271,47444,235,593103,372,0001,008,000319,488
9Oct 9, 2026 07:271,47844,347,128103,675,0001,008,000319,488