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 18:02anboto1anboto1Score: 23,063Success
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 18:0322,004735,916,897719,410,0006,735,0002,113,536
2Jun 7, 2026 18:0322,276744,418,607728,225,0006,891,0002,113,536
3Jun 7, 2026 18:0322,278744,954,167728,309,0006,867,0002,113,536
4Jun 7, 2026 18:0322,325746,467,736729,982,0006,771,0002,113,536
5Jun 7, 2026 18:0323,063770,388,925754,160,0006,922,0002,113,536
6Jun 7, 2026 18:0323,170774,287,767757,741,0006,889,0002,113,536
7Jun 7, 2026 18:0323,288780,815,855761,484,0007,033,0002,113,536
8Jun 7, 2026 18:0323,376780,730,117764,381,0007,027,0002,113,536
9Jun 7, 2026 18:0323,464783,662,398767,405,0006,915,0002,113,536