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:19Andrew EpsteinAndrew EpsteinScore: 1,473Success
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:251,46744,032,34899,996,0001,207,0002,170,880stderr
2Oct 31, 2026 09:251,46944,099,68898,614,0003,114,0002,162,688stderr
3Oct 31, 2026 09:251,46944,086,234100,684,0001,181,0002,170,880stderr
4Oct 31, 2026 09:251,47144,146,925101,180,0001,116,0002,162,688stderr
5Oct 31, 2026 09:251,47344,195,251100,792,0001,252,0002,170,880stderr
6Oct 31, 2026 09:251,47344,204,890100,704,0001,209,0002,170,880stderr
7Oct 31, 2026 09:251,48244,466,987102,059,0001,101,0002,162,688stderr
8Oct 31, 2026 09:251,48444,545,462102,386,0001,114,0002,170,880stderr
9Oct 31, 2026 09:251,48444,539,725102,511,0001,115,0002,162,688stderr