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 25, 2026 17:38boop34boop34Score: 6,692Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2026 17:396,645230,392,820216,362,0002,944,0002,113,536
2Jul 25, 2026 17:396,678231,735,623217,199,0003,176,0002,113,536
3Jul 25, 2026 17:396,684230,421,018216,263,0004,318,0002,113,536
4Jul 25, 2026 17:396,687230,511,368216,421,0004,257,0002,113,536
5Jul 25, 2026 17:396,692231,575,769217,449,0003,388,0002,113,536
6Jul 25, 2026 17:396,694230,905,796216,783,0004,148,0002,113,536
7Jul 25, 2026 17:396,697230,883,222216,631,0004,374,0002,113,536
8Jul 25, 2026 17:396,698230,969,753216,595,0004,442,0002,113,536
9Jul 25, 2026 17:396,745232,541,816218,492,0004,116,0002,113,536