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 listJan 12, 2026 22:25Adam FolwarcznyAdam FolwarcznyScore: 90,509Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 22:2590,0523,005,597,9742,960,714,00010,995,0002,424,832
2Jan 12, 2026 22:2590,5093,014,784,9492,975,806,00010,995,0002,277,376
3Jan 12, 2026 22:2590,9973,034,885,2502,990,901,00011,991,0002,277,376