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 16:28Josu San MartinJosu San MartinScore: 3,461Success
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 16:293,439124,412,215112,465,0001,045,0002,113,536
2May 13, 2026 16:293,440122,378,972112,475,0001,048,0002,113,536
3May 13, 2026 16:293,450124,322,513112,822,0001,051,0002,113,536
4May 13, 2026 16:293,450124,368,041112,803,0001,052,0002,113,536
5May 13, 2026 16:293,461123,435,321113,162,0001,063,0002,113,536
6May 13, 2026 16:293,471126,236,423113,494,0001,052,0002,113,536
7May 13, 2026 16:293,477123,621,100113,724,0001,043,0002,113,536
8May 13, 2026 16:293,482125,883,927113,849,0001,065,0002,113,536
9May 13, 2026 16:293,483123,767,610113,901,0001,058,0002,113,536