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:09e1011e1011Score: 66,852Success
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:1166,1402,193,787,3552,174,139,0008,498,0002,113,536
2Oct 17, 2026 21:1166,2612,197,768,0822,178,126,0008,511,0002,113,536
3Oct 17, 2026 21:1166,2852,198,597,6222,178,741,0008,665,0002,113,536
4Oct 17, 2026 21:1166,6902,211,870,7482,192,107,0008,664,0002,113,536
5Oct 17, 2026 21:1166,8522,217,447,0682,197,614,0008,531,0002,113,536
6Oct 17, 2026 21:1166,8682,217,772,3632,198,083,0008,572,0002,113,536
7Oct 17, 2026 21:1168,4072,268,629,6192,248,930,0008,506,0002,113,536
8Oct 17, 2026 21:1169,6552,310,223,8222,290,311,0008,320,0002,113,536
9Oct 17, 2026 21:1170,1352,325,573,5332,305,831,0008,637,0002,113,536