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:01Andrew EpsteinAndrew EpsteinScore: 1,518Success
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:081,49044,729,406102,545,0001,279,0002,162,688
2Oct 31, 2026 04:081,50245,064,335103,475,0001,201,0002,170,880
3Oct 31, 2026 04:081,50445,138,535104,007,0001,185,0002,170,880
4Oct 31, 2026 04:081,51845,560,761105,135,0001,017,0002,162,688
5Oct 31, 2026 04:081,51845,541,686104,901,0001,021,0002,162,688
6Oct 31, 2026 04:081,52145,657,898105,233,0001,187,0002,170,880
7Oct 31, 2026 04:081,52345,715,404105,005,0001,259,0002,162,688
8Oct 31, 2026 04:081,52745,838,392105,538,0001,018,0002,170,880
9Oct 31, 2026 04:081,54646,407,745105,111,0001,134,0002,170,880