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 listJun 7, 2026 22:16anboto1anboto1Score: 11,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 22:2011,274381,824,045359,947,00012,117,0002,117,632
2Jun 7, 2026 22:2011,303382,685,190360,908,00012,094,0002,117,632
3Jun 7, 2026 22:2011,314384,335,382361,337,00012,025,0002,117,632
4Jun 7, 2026 22:2011,405385,716,039364,206,00012,162,0002,117,632
5Jun 7, 2026 22:2011,414385,998,622364,552,00012,125,0002,117,632
6Jun 7, 2026 22:2011,416386,023,808364,033,00012,714,0002,117,632
7Jun 7, 2026 22:2011,434386,681,663365,136,00012,187,0002,117,632
8Jun 7, 2026 22:2011,452387,320,164365,219,00012,728,0002,117,632
9Jun 7, 2026 22:2011,738396,653,310375,128,00012,248,0002,117,632