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 listJun 9, 2026 13:26Maya RebholzMaya RebholzError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 17:1307,316,392,0007,289,527,00016,709,0002,113,536expected "1022854 ", got "2595 170299 2065064 2299281 "
2Jun 9, 2026 17:1307,312,703,4157,288,443,00014,894,0002,113,536expected "1019711 ", got "2680 170932 2067323 2293524 "
3Jun 9, 2026 17:1307,311,193,7907,287,319,00014,280,0002,113,536expected "1018811 ", got "2587 170679 2056565 2318155 "