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 04:31e1011e1011Score: 183,508Success
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 04:33179,8865,948,653,5385,913,014,00023,234,0002,113,536
2Oct 17, 2026 04:33180,1965,957,547,8225,922,690,00023,808,0002,113,536
3Oct 17, 2026 04:33180,3285,961,748,4105,927,927,00022,899,0002,113,536
4Oct 17, 2026 04:33181,0185,984,615,6855,950,366,00023,246,0002,113,536
5Oct 17, 2026 04:33183,5086,066,764,5856,031,526,00024,257,0002,113,536
6Oct 17, 2026 04:33183,8246,077,421,6976,040,837,00025,370,0002,113,536
7Oct 17, 2026 04:33183,8876,079,425,2976,042,861,00025,428,0002,113,536
8Oct 17, 2026 04:33184,3756,095,707,4476,058,966,00025,441,0002,113,536
9Oct 17, 2026 04:33186,3466,160,337,1396,124,357,00025,067,0002,113,536