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 25, 2026 08:42Nao MinamiNao MinamiScore: 19,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2026 08:4319,647659,266,181627,992,00020,387,0002,113,536
2Oct 25, 2026 08:4319,732662,085,342631,358,00019,800,0002,113,536
3Oct 25, 2026 08:4319,804665,713,511633,536,00020,019,0002,113,536
4Oct 25, 2026 08:4319,865666,361,415635,605,00019,959,0002,113,536
5Oct 25, 2026 08:4319,869666,512,756635,783,00019,896,0002,113,536
6Oct 25, 2026 08:4319,898667,510,868636,789,00019,862,0002,113,536
7Oct 25, 2026 08:4319,942669,137,749637,601,00020,496,0002,113,536
8Oct 25, 2026 08:4319,973669,873,184639,077,00020,038,0002,113,536
9Oct 25, 2026 08:4320,031671,870,809640,674,00020,355,0002,113,536