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:15e1011e1011Score: 71,459Success
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:1770,1782,327,205,1002,307,438,0008,449,0002,113,536
2Oct 17, 2026 21:1770,3562,333,389,2342,313,284,0008,465,0002,113,536
3Oct 17, 2026 21:1770,7462,345,742,7422,325,950,0008,698,0002,113,536
4Oct 17, 2026 21:1771,0942,357,204,7522,337,441,0008,666,0002,113,536
5Oct 17, 2026 21:1771,4592,374,251,7592,349,222,0008,942,0002,113,536
6Oct 17, 2026 21:1772,0102,387,973,9672,367,660,0008,690,0002,113,536
7Oct 17, 2026 21:1773,4252,434,122,0272,414,646,0008,389,0002,113,536
8Oct 17, 2026 21:1773,5022,436,990,2272,417,227,0008,343,0002,113,536
9Oct 17, 2026 21:1773,6462,441,632,7202,421,938,0008,403,0002,117,632