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 17, 2026 04:52M-RochatM-RochatScore: 20,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 04:5420,356680,821,135667,711,0004,061,0002,113,536
2May 17, 2026 04:5420,395683,057,747668,953,0004,110,0002,113,536
3May 17, 2026 04:5420,685693,331,754678,519,0004,087,0002,113,536
4May 17, 2026 04:5420,732693,828,252680,121,0004,044,0002,113,536
5May 17, 2026 04:5420,956702,771,491687,311,0004,256,0002,113,536
6May 17, 2026 04:5422,914765,762,179752,134,0004,033,0002,113,536
7May 17, 2026 04:5422,934767,640,875752,601,0004,239,0002,113,536
8May 17, 2026 04:5422,956766,526,486753,270,0004,307,0002,113,536
9May 17, 2026 04:5423,073772,903,184757,427,0004,014,0002,113,536