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 listFeb 21, 2026 15:01Alexander KrivolapovAlexander KrivolapovScore: 48,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 15:0148,5311,621,708,5781,596,530,0004,998,0002,535,424
2Feb 21, 2026 15:0148,6061,632,686,7471,600,006,0003,997,0002,457,600
3Feb 21, 2026 15:0149,0031,643,882,1381,613,111,0003,997,0002,506,752