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 17:30anboto1anboto1Score: 25,075Success
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 17:3124,851831,007,653813,582,0006,511,0002,113,536
2Jun 7, 2026 17:3124,862829,907,639813,739,0006,733,0002,113,536
3Jun 7, 2026 17:3124,896831,028,760815,072,0006,527,0002,113,536
4Jun 7, 2026 17:3124,966833,138,340817,323,0006,574,0002,113,536
5Jun 7, 2026 17:3125,075836,868,077821,014,0006,493,0002,113,536
6Jun 7, 2026 17:3125,130838,646,730822,516,0006,780,0002,113,536
7Jun 7, 2026 17:3125,202840,980,864825,194,0006,485,0002,113,536
8Jun 7, 2026 17:3126,303877,330,044861,192,0006,832,0002,113,536
9Jun 7, 2026 17:3126,803901,269,080877,748,0006,765,0002,113,536