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 04:41Karthik ReddyKarthik ReddyScore: 2,952Success
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 04:422,900104,892,19594,674,0001,036,00020,480
2Oct 6, 2026 04:422,904104,924,94494,791,0001,070,00020,480
3Oct 6, 2026 04:422,924105,590,86695,446,0001,049,00020,480
4Oct 6, 2026 04:422,940106,027,72196,019,0001,015,00020,480
5Oct 6, 2026 04:422,952106,543,77896,416,0001,012,00020,480
6Oct 6, 2026 04:422,956106,608,72396,515,0001,052,00020,480
7Oct 6, 2026 04:422,977107,318,03597,200,0001,070,00020,480
8Oct 6, 2026 04:422,982107,439,04397,426,0001,011,00020,480
9Oct 6, 2026 04:422,983107,530,52397,319,0001,150,00020,480