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 17, 2026 22:45e1011e1011Score: 37,911Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 22:4637,8091,258,700,2001,238,165,0009,551,0002,113,536
2Oct 17, 2026 22:4637,8201,259,073,4181,238,579,0009,501,0002,113,536
3Oct 17, 2026 22:4637,8291,259,375,5021,238,652,0009,719,0002,113,536
4Oct 17, 2026 22:4637,8321,259,563,3111,238,933,0009,548,0002,113,536
5Oct 17, 2026 22:4637,9111,262,121,0381,241,470,0009,624,0002,113,536
6Oct 17, 2026 22:4638,1861,271,294,8391,250,367,0009,779,0002,113,536
7Oct 17, 2026 22:4638,2291,273,079,6571,251,932,0009,657,0002,113,536
8Oct 17, 2026 22:4638,3111,275,817,3401,254,474,0009,795,0002,113,536
9Oct 17, 2026 22:4638,3811,277,711,0401,256,858,0009,742,0002,113,536