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 18:22anboto1anboto1Score: 22,294Success
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 18:2322,217742,595,624726,467,0006,704,0002,113,536
2Jun 7, 2026 18:2322,230742,973,489727,025,0006,577,0002,113,536
3Jun 7, 2026 18:2322,267744,551,564728,013,0006,805,0002,113,536
4Jun 7, 2026 18:2322,293745,102,598729,036,0006,645,0002,113,536
5Jun 7, 2026 18:2322,294745,595,471729,003,0006,730,0002,113,536
6Jun 7, 2026 18:2322,325746,569,922729,914,0006,818,0002,113,536
7Jun 7, 2026 18:2322,333746,364,693730,193,0006,797,0002,113,536
8Jun 7, 2026 18:2323,297778,155,740761,741,0007,074,0002,113,536
9Jun 7, 2026 18:2323,440783,264,580766,668,0006,882,0002,113,536