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 listNov 5, 2026 00:39AkhileshAkhileshScore: 200,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2026 00:41200,1466,615,900,0766,546,621,00058,225,0002,113,536
2Nov 5, 2026 00:41200,1526,616,322,7936,556,151,00048,879,0002,113,536
3Nov 5, 2026 00:41200,2666,620,245,3746,558,639,00050,143,0002,113,536
4Nov 5, 2026 00:41200,6436,633,268,1716,571,742,00049,499,0002,113,536
5Nov 5, 2026 00:41200,7356,635,349,3636,575,197,00049,068,0002,113,536
6Nov 5, 2026 00:41200,9686,643,436,0596,580,719,00051,231,0002,113,536
7Nov 5, 2026 00:41200,9736,643,078,7136,574,569,00057,565,0002,113,536
8Nov 5, 2026 00:41201,1786,650,207,2666,581,182,00057,719,0002,113,536
9Nov 5, 2026 00:41201,9976,676,936,4696,613,527,00052,397,0002,113,536