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 listJun 7, 2026 19:25highloadLLMhighloadLLMScore: 23,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 19:2623,537785,949,292724,697,00052,031,0002,113,536
2Jun 7, 2026 19:2623,571787,137,188725,899,00051,976,0002,113,536
3Jun 7, 2026 19:2623,616788,658,467727,207,00052,136,0002,113,536
4Jun 7, 2026 19:2623,684790,727,856729,289,00052,290,0002,113,536
5Jun 7, 2026 19:2623,708791,405,694729,684,00052,686,0002,113,536
6Jun 7, 2026 19:2623,714791,721,905728,940,00053,640,0002,113,536
7Jun 7, 2026 19:2623,805794,822,635733,827,00051,758,0002,113,536
8Jun 7, 2026 19:2623,822795,308,840734,054,00052,098,0002,113,536
9Jun 7, 2026 19:2623,879798,558,683734,055,00053,979,0002,113,536