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 listMar 15, 2026 03:07limanjun99limanjun99Score: 14,423Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 03:0713,788478,502,160450,004,0005,000,0002,506,752
2Mar 15, 2026 03:0713,814483,063,904450,855,0004,998,0002,383,872
3Mar 15, 2026 03:0714,293495,154,123464,677,0006,995,0002,506,752
4Mar 15, 2026 03:0714,335500,806,023466,059,0007,000,0002,506,752
5Mar 15, 2026 03:0714,423499,378,349471,971,0003,999,0002,449,408
6Mar 15, 2026 03:0714,544500,779,646472,963,0006,999,0002,371,584
7Mar 15, 2026 03:0714,741514,489,765479,472,0006,992,0002,506,752
8Mar 15, 2026 03:0714,751509,479,226482,788,0003,998,0002,473,984
9Mar 15, 2026 03:0716,791586,578,576550,113,0004,000,0002,281,472