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 23, 2025 03:06Ian MckibbenIan MckibbenScore: 15,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 03:0615,408532,848,801439,531,00068,926,0002,310,144
2Jun 23, 2025 03:2715,442531,086,243434,645,00074,938,0002,318,336
3Jun 23, 2025 03:2715,463534,813,711418,414,00091,871,0002,314,240
4Jun 23, 2025 03:0615,472534,010,311434,633,00075,935,0002,281,472
5Jun 23, 2025 03:2715,492542,441,389446,321,00064,901,0002,314,240
6Jun 23, 2025 03:0615,527541,497,567438,473,00073,911,0002,383,872