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 listNov 12, 2025 15:19Aliaksandr MikheiAliaksandr MikheiScore: 105,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2025 15:19104,8513,491,925,7563,285,238,000174,853,0002,392,064
2Nov 12, 2025 15:19105,2573,500,632,6733,273,632,000199,855,0002,379,776
3Nov 12, 2025 15:19105,8693,526,328,5883,301,796,000191,871,0002,293,760