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 listSep 26, 2026 19:39Kevin HeaveyKevin HeaveyScore: 2,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 19:412,769100,070,45090,374,0001,004,00020,480
2Sep 26, 2026 19:412,778100,361,69390,639,0001,047,00020,480
3Sep 26, 2026 19:412,779100,355,13290,688,0001,050,00020,480
4Sep 26, 2026 19:412,781100,569,14390,751,0001,050,00020,480
5Sep 26, 2026 19:412,783100,491,47290,821,0001,042,00020,480
6Sep 26, 2026 19:412,788100,665,64791,005,0001,028,00020,480
7Sep 26, 2026 19:412,790100,490,49091,039,0001,047,00020,480
8Sep 26, 2026 19:412,792100,906,74091,096,0001,042,00020,480
9Sep 26, 2026 19:412,814101,493,02791,834,0001,059,00020,480