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 22, 2026 23:39Victor MerckléVictor MerckléScore: 4,974Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 23:394,945170,726,185126,528,00036,662,0002,113,536
2Jun 22, 2026 23:394,946170,975,312126,502,00036,732,0002,113,536
3Jun 22, 2026 23:394,964171,407,686127,077,00036,762,0002,113,536
4Jun 22, 2026 23:394,973172,006,953127,388,00036,735,0002,113,536
5Jun 22, 2026 23:394,974171,658,371127,192,00036,967,0002,113,536
6Jun 22, 2026 23:394,976172,016,115127,490,00036,730,0002,113,536
7Jun 22, 2026 23:394,979171,760,579126,458,00037,872,0002,113,536
8Jun 22, 2026 23:394,993172,799,050127,179,00037,597,0002,113,536
9Jun 22, 2026 23:395,016173,810,364127,589,00037,963,0002,113,536