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:35boop34boop34Score: 6,769Success
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:366,734233,018,981218,406,0003,830,0002,113,536
2Jul 25, 2026 17:366,750233,474,646219,493,0003,277,0002,113,536
3Jul 25, 2026 17:366,757233,777,200219,761,0003,239,0002,113,536
4Jul 25, 2026 17:366,767233,319,572219,368,0003,968,0002,113,536
5Jul 25, 2026 17:366,769233,194,907219,188,0004,190,0002,113,536
6Jul 25, 2026 17:366,773233,377,196219,465,0004,057,0002,113,536
7Jul 25, 2026 17:366,776233,582,718219,554,0004,059,0002,113,536
8Jul 25, 2026 17:366,778233,651,369219,472,0004,204,0002,113,536
9Jul 25, 2026 17:366,784233,806,335219,621,0004,252,0002,113,536