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 00:16M-RochatM-RochatScore: 23,896Success
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 00:1923,790796,908,437778,081,0006,996,0002,113,536
2May 17, 2026 00:1923,816794,980,010779,120,0006,839,0002,113,536
3May 17, 2026 00:1923,849797,358,177780,132,0006,901,0002,113,536
4May 17, 2026 00:1923,887798,463,849781,323,0006,966,0002,113,536
5May 17, 2026 00:1923,896800,286,180781,745,0006,827,0002,113,536
6May 17, 2026 00:1923,959801,689,487783,851,0006,808,0002,113,536
7May 17, 2026 00:1924,049805,403,284786,798,0006,839,0002,113,536
8May 17, 2026 00:1925,231846,203,143825,245,0007,403,0002,113,536
9May 17, 2026 00:1925,416847,903,183831,519,0007,240,0002,113,536