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:21e1011e1011Score: 85,520Success
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:2484,9012,812,922,6022,752,419,00049,332,0002,113,536
2Oct 17, 2026 21:2485,3242,826,979,6552,765,919,00049,802,0002,113,536
3Oct 17, 2026 21:2485,4632,831,786,7472,770,907,00049,375,0002,113,536
4Oct 17, 2026 21:2485,5012,832,697,6492,772,410,00049,125,0002,113,536
5Oct 17, 2026 21:2485,5202,833,656,7812,774,784,00047,395,0002,113,536
6Oct 17, 2026 21:2485,6092,836,217,4912,776,613,00048,503,0002,113,536
7Oct 17, 2026 21:2485,7452,840,728,9842,781,301,00048,295,0002,113,536
8Oct 17, 2026 21:2485,7572,841,149,6482,780,937,00049,052,0002,113,536
9Oct 17, 2026 21:2486,0152,849,671,6622,790,854,00047,648,0002,113,536