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:26anboto1anboto1Score: 24,827Success
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:2824,384814,142,008797,899,0006,780,0002,113,536
2Jun 7, 2026 17:2824,503818,003,524801,888,0006,726,0002,113,536
3Jun 7, 2026 17:2824,525819,190,447802,530,0006,817,0002,113,536
4Jun 7, 2026 17:2824,607821,783,138805,416,0006,629,0002,113,536
5Jun 7, 2026 17:2824,827828,896,158812,598,0006,700,0002,113,536
6Jun 7, 2026 17:2825,447849,148,013833,059,0006,713,0002,113,536
7Jun 7, 2026 17:2825,879863,416,118847,176,0006,857,0002,113,536
8Jun 7, 2026 17:2825,892866,675,869847,582,0006,864,0002,113,536
9Jun 7, 2026 17:2826,095870,392,479854,231,0006,905,0002,113,536