Unique strings Sergey Svistunov

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 6, 2026 05:13Karthik ReddyKarthik ReddyScore: 2,794Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 6, 2026 05:142,75099,936,40289,769,0001,005,00020,480
2Oct 6, 2026 05:142,767100,417,99690,274,0001,044,00020,480
3Oct 6, 2026 05:142,784100,888,89290,875,0001,004,00020,480
4Oct 6, 2026 05:142,793101,270,73091,159,0001,033,00020,480
5Oct 6, 2026 05:142,794101,328,48791,201,0001,012,00020,480
6Oct 6, 2026 05:142,811101,876,86791,782,0001,007,00020,480
7Oct 6, 2026 05:142,813101,915,98191,769,0001,066,00020,480
8Oct 6, 2026 05:142,823102,242,18892,170,0001,007,00020,480
9Oct 6, 2026 05:142,841102,906,89592,777,0001,007,00020,480