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 05:36Josu San MartinJosu San MartinScore: 4,270Success
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 05:364,263173,772,339139,678,000997,0002,301,952
2Feb 21, 2026 05:364,264164,786,801138,706,0001,995,0002,301,952
3Feb 21, 2026 05:364,265166,374,688139,731,000998,0002,301,952
4Feb 21, 2026 05:364,269163,365,513138,870,0001,998,0002,404,352
5Feb 21, 2026 05:364,270170,580,507139,923,000999,0002,301,952
6Feb 21, 2026 05:364,273164,402,613138,001,0003,000,0002,301,952
7Feb 21, 2026 05:364,276163,424,258139,098,0002,001,0002,400,256
8Feb 21, 2026 05:364,279164,329,462139,210,0002,003,0002,301,952
9Feb 21, 2026 05:364,286170,066,933140,420,0001,003,0002,293,760