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 listMay 15, 2026 00:00Josu San MartinJosu San MartinScore: 3,448Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 00:013,442123,877,229112,566,0001,042,0002,113,536
2May 15, 2026 00:013,444124,239,874112,618,0001,040,0002,113,536
3May 15, 2026 00:013,446123,218,186112,674,0001,051,0002,113,536
4May 15, 2026 00:013,447122,516,705112,708,0001,060,0002,113,536
5May 15, 2026 00:013,448125,144,994112,765,0001,049,0002,113,536
6May 15, 2026 00:013,450122,602,513112,814,0001,048,0002,113,536
7May 15, 2026 00:013,454124,018,248112,935,0001,056,0002,113,536
8May 15, 2026 00:013,471124,400,571113,520,0001,032,0002,113,536
9May 15, 2026 00:013,475125,240,351113,633,0001,053,0002,113,536