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:12Josu San MartinJosu San MartinScore: 3,507Success
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:133,483125,105,326113,909,0001,037,0002,113,536
2May 14, 2026 23:133,492126,934,076114,206,0001,061,0002,113,536
3May 14, 2026 23:133,505125,590,372114,651,0001,045,0002,113,536
4May 14, 2026 23:133,506124,534,337114,659,0001,062,0002,113,536
5May 14, 2026 23:133,507124,567,286114,712,0001,049,0002,113,536
6May 14, 2026 23:133,509125,054,825114,776,0001,053,0002,113,536
7May 14, 2026 23:133,510125,139,137114,845,0001,014,0002,113,536
8May 14, 2026 23:133,510126,343,708114,794,0001,058,0002,113,536
9May 14, 2026 23:133,511124,644,456114,812,0001,057,0002,113,536