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 14, 2025 07:24Nguyen Thanh VinhNguyen Thanh VinhScore: 338,792Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2025 07:24335,34211,100,020,39510,979,323,00086,947,0002,326,528
2Oct 14, 2025 07:24338,79211,217,967,91811,085,184,00094,941,0002,473,984
3Oct 14, 2025 07:24338,97611,221,119,63011,092,262,00093,934,0002,404,352