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 21:20e1011e1011Score: 66,796Success
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 21:2366,5572,207,687,1992,187,273,0009,129,0002,113,536
2Oct 17, 2026 21:2366,6702,211,684,0282,191,049,0009,063,0002,113,536
3Oct 17, 2026 21:2366,6742,213,308,2942,191,131,0009,123,0002,113,536
4Oct 17, 2026 21:2366,6922,212,029,5522,191,733,0009,103,0002,113,536
5Oct 17, 2026 21:2366,7962,215,418,9532,195,199,0009,080,0002,113,536
6Oct 17, 2026 21:2367,1572,228,126,4062,206,969,0009,231,0002,113,536
7Oct 17, 2026 21:2367,4162,235,833,5082,215,623,0009,117,0002,113,536
8Oct 17, 2026 21:2369,4672,303,617,6562,282,934,0009,500,0002,113,536
9Oct 17, 2026 21:2369,5722,307,040,4022,286,376,0009,531,0002,113,536