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:21anboto1anboto1Score: 25,116Success
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:2324,738825,716,981809,754,0006,621,0002,113,536
2Jun 7, 2026 17:2324,835828,964,625812,890,0006,671,0002,113,536
3Jun 7, 2026 17:2325,028835,291,832819,314,0006,619,0002,113,536
4Jun 7, 2026 17:2325,114838,156,836822,113,0006,662,0002,113,536
5Jun 7, 2026 17:2325,116841,650,107822,237,0006,622,0002,113,536
6Jun 7, 2026 17:2325,120838,434,891822,389,0006,584,0002,113,536
7Jun 7, 2026 17:2325,152839,363,342823,345,0006,695,0002,113,536
8Jun 7, 2026 17:2325,185841,789,098824,548,0006,571,0002,113,536
9Jun 7, 2026 17:2325,278843,557,203827,411,0006,788,0002,113,536