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 listOct 16, 2026 21:22izotoffizotoffScore: 172,574Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 21:23171,9805,686,383,6115,621,691,00053,664,0002,113,536
2Oct 16, 2026 21:23172,0245,687,888,9085,617,924,00058,877,0002,113,536
3Oct 16, 2026 21:23172,4505,701,959,0655,638,582,00052,300,0002,113,536
4Oct 16, 2026 21:23172,4825,702,795,2345,641,784,00050,150,0002,113,536
5Oct 16, 2026 21:23172,5745,705,796,8025,635,904,00059,069,0002,113,536
6Oct 16, 2026 21:23173,3215,731,970,3265,669,975,00049,630,0002,113,536
7Oct 16, 2026 21:23173,4455,734,717,5345,665,512,00058,174,0002,113,536
8Oct 16, 2026 21:23173,5035,736,991,8995,665,731,00059,898,0002,113,536
9Oct 16, 2026 21:23174,0575,755,383,9645,694,066,00049,834,0002,113,536