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 06:16e1011e1011Score: 68,162Success
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 06:1767,5122,238,906,9492,219,169,0008,756,0002,113,536
2Oct 17, 2026 06:1767,7412,246,346,2982,226,133,0009,331,0002,113,536
3Oct 17, 2026 06:1767,8582,250,158,4862,230,996,0008,349,0002,113,536
4Oct 17, 2026 06:1768,0142,255,358,8402,236,224,0008,248,0002,113,536
5Oct 17, 2026 06:1768,1622,260,211,7072,240,945,0008,433,0002,113,536
6Oct 17, 2026 06:1768,2082,262,310,6242,242,558,0008,326,0002,113,536
7Oct 17, 2026 06:1768,3942,267,936,6452,248,653,0008,360,0002,113,536
8Oct 17, 2026 06:1768,4902,271,009,8342,251,859,0008,321,0002,113,536
9Oct 17, 2026 06:1769,0562,290,283,0412,270,230,0008,627,0002,113,536