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 19:01Pavel SkripkinPavel SkripkinScore: 12,107Success
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 19:0211,228377,870,713368,522,0002,009,0002,117,632
2May 13, 2026 19:0211,351382,600,232371,589,0003,016,0002,117,632
3May 13, 2026 19:0211,522387,650,661377,060,0003,170,0002,117,632
4May 13, 2026 19:0211,658392,062,369381,699,0003,031,0002,117,632
5May 13, 2026 19:0212,107407,021,125396,539,0003,007,0002,117,632
6May 13, 2026 19:0212,151410,482,010397,951,0003,058,0002,117,632
7May 13, 2026 19:0212,297415,202,874402,729,0003,080,0002,117,632
8May 13, 2026 19:0212,328415,151,060403,833,0003,011,0002,117,632
9May 13, 2026 19:0212,458420,522,212408,057,0003,087,0002,117,632