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 8, 2026 11:47anboto1anboto1Score: 11,858Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 11:4811,754397,150,863385,817,0002,071,0002,113,536
2Jun 8, 2026 11:4811,830399,718,733388,140,0002,281,0002,113,536
3Jun 8, 2026 11:4811,841402,953,114388,722,0002,032,0002,113,536
4Jun 8, 2026 11:4811,845400,206,200388,841,0002,056,0002,113,536
5Jun 8, 2026 11:4811,858400,646,483389,295,0002,040,0002,113,536
6Jun 8, 2026 11:4811,890401,702,921390,305,0002,074,0002,113,536
7Jun 8, 2026 11:4811,938403,687,670391,870,0002,098,0002,113,536
8Jun 8, 2026 11:4811,949403,609,557392,315,0002,028,0002,113,536
9Jun 8, 2026 11:4812,104408,693,384397,356,0002,077,0002,113,536