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 19:31highloadLLMhighloadLLMScore: 21,834Success
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 19:3221,669724,364,148668,263,00046,832,0002,113,536
2Jun 7, 2026 19:3221,694725,213,975668,577,00047,330,0002,113,536
3Jun 7, 2026 19:3221,723726,102,127669,641,00047,220,0002,113,536
4Jun 7, 2026 19:3221,753726,980,846670,809,00047,067,0002,113,536
5Jun 7, 2026 19:3221,834729,673,189673,299,00047,223,0002,113,536
6Jun 7, 2026 19:3221,836729,832,840672,701,00047,908,0002,113,536
7Jun 7, 2026 19:3221,842731,483,780672,871,00047,943,0002,113,536
8Jun 7, 2026 19:3221,852730,248,018673,974,00047,170,0002,113,536
9Jun 7, 2026 19:3221,873731,103,685674,702,00047,109,0002,113,536