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:37boop34boop34Score: 13,249Success
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:3813,218445,985,362431,157,0005,054,0002,113,536
2Jul 23, 2026 16:3813,219446,214,492431,124,0005,118,0002,113,536
3Jul 23, 2026 16:3813,225446,203,246431,125,0005,321,0002,113,536
4Jul 23, 2026 16:3813,245446,891,830432,115,0004,979,0002,113,536
5Jul 23, 2026 16:3813,249446,986,178432,111,0005,116,0002,113,536
6Jul 23, 2026 16:3813,261447,513,197432,556,0005,076,0002,113,536
7Jul 23, 2026 16:3813,265447,547,514432,757,0005,003,0002,113,536
8Jul 23, 2026 16:3813,278448,011,006433,025,0005,149,0002,113,536
9Jul 23, 2026 16:3813,296448,550,349433,893,0004,879,0002,113,536