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 listJul 23, 2026 16:43boop34boop34Score: 13,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 16:4412,919436,130,361394,827,00031,530,0002,113,536
2Jul 23, 2026 16:4412,930436,430,957394,774,00031,921,0002,113,536
3Jul 23, 2026 16:4412,986438,320,219396,694,00031,850,0002,113,536
4Jul 23, 2026 16:4412,989438,397,986397,469,00031,171,0002,113,536
5Jul 23, 2026 16:4413,018439,438,701396,428,00033,170,0002,113,536
6Jul 23, 2026 16:4413,024439,589,929396,898,00032,907,0002,113,536
7Jul 23, 2026 16:4413,034440,020,669398,958,00031,195,0002,113,536
8Jul 23, 2026 16:4413,047440,343,694398,890,00031,682,0002,113,536
9Jul 23, 2026 16:4414,192478,354,932435,544,00032,814,0002,113,536