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 13, 2026 01:02Josu San MartinJosu San MartinScore: 3,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 01:033,882136,840,525127,007,0001,100,0002,113,536
2May 13, 2026 01:033,882137,714,954127,044,0001,073,0002,113,536
3May 13, 2026 01:033,885138,758,375127,142,0001,072,0002,113,536
4May 13, 2026 01:033,887140,006,601127,212,0001,061,0002,113,536
5May 13, 2026 01:033,892138,094,101127,393,0001,043,0002,113,536
6May 13, 2026 01:033,899138,934,716127,579,0001,110,0002,113,536
7May 13, 2026 01:033,899138,702,069127,544,0001,130,0002,113,536
8May 13, 2026 01:033,900138,508,258127,584,0001,124,0002,113,536
9May 13, 2026 01:033,903139,188,175127,716,0001,114,0002,113,536