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 15:57highloadLLMhighloadLLMScore: 57,336Success
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 15:5956,7021,880,387,9581,821,878,00049,317,0002,113,536
2Jun 7, 2026 15:5956,7961,883,370,9961,825,159,00049,111,0002,113,536
3Jun 7, 2026 15:5956,8651,885,775,2021,826,616,00049,947,0002,113,536
4Jun 7, 2026 15:5957,0391,891,405,9381,832,774,00049,517,0002,113,536
5Jun 7, 2026 15:5957,3361,901,369,4421,844,816,00047,276,0002,113,536
6Jun 7, 2026 15:5957,4311,904,476,0941,847,942,00047,286,0002,113,536
7Jun 7, 2026 15:5957,5241,907,546,9511,851,374,00046,941,0002,113,536
8Jun 7, 2026 15:5957,6931,913,139,6431,856,582,00047,313,0002,113,536
9Jun 7, 2026 15:5957,7621,915,733,3891,858,688,00047,471,0002,113,536