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 16, 2026 08:29M-RochatM-RochatScore: 53,463Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 08:3052,5441,746,123,5921,721,236,00012,728,0002,113,536
2May 16, 2026 08:3052,6681,748,884,9651,725,348,00012,724,0002,113,536
3May 16, 2026 08:3052,9401,755,875,7921,733,950,00013,093,0002,113,536
4May 16, 2026 08:3053,4391,774,312,6851,750,819,00012,696,0002,113,536
5May 16, 2026 08:3053,4631,775,370,9341,751,499,00012,803,0002,113,536
6May 16, 2026 08:3053,8421,785,711,9661,763,577,00013,225,0002,113,536
7May 16, 2026 08:3055,3761,839,197,5851,814,100,00013,323,0002,113,536
8May 16, 2026 08:3055,4541,840,806,3681,816,835,00013,172,0002,113,536
9May 16, 2026 08:3055,5561,842,176,5841,820,484,00012,881,0002,113,536