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 14, 2026 23:10Josu San MartinJosu San MartinScore: 3,440Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 23:113,413122,009,331111,578,0001,057,0002,113,536
2May 14, 2026 23:113,415121,395,066111,684,0001,031,0002,113,536
3May 14, 2026 23:113,419122,244,994111,792,0001,051,0002,113,536
4May 14, 2026 23:113,419124,207,954111,805,0001,052,0002,113,536
5May 14, 2026 23:113,440122,352,632112,512,0001,039,0002,113,536
6May 14, 2026 23:113,442125,397,520112,560,0001,049,0002,113,536
7May 14, 2026 23:113,451123,990,146112,852,0001,048,0002,113,536
8May 14, 2026 23:113,451124,776,710112,848,0001,050,0002,113,536
9May 14, 2026 23:113,457124,055,378113,046,0001,051,0002,113,536