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 listOct 20, 2026 20:30janwwwjanwwwScore: 9,652Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 20:319,573326,691,032311,764,0004,155,0002,113,536
2Oct 20, 2026 20:319,603327,857,617313,756,0003,151,0002,113,536
3Oct 20, 2026 20:319,639328,846,117314,927,0003,160,0002,113,536
4Oct 20, 2026 20:319,643329,124,196314,907,0003,344,0002,113,536
5Oct 20, 2026 20:319,652329,616,094315,242,0003,279,0002,113,536
6Oct 20, 2026 20:319,655329,331,660315,335,0003,293,0002,113,536
7Oct 20, 2026 20:319,673330,052,528316,012,0003,215,0002,113,536
8Oct 20, 2026 20:319,676331,480,057316,060,0003,262,0002,113,536
9Oct 20, 2026 20:319,794334,012,539319,908,0003,323,0002,113,536